Changeset b3c8496

Timestamp:

Dec 16, 2020, 4:01:49 PM (4 years ago)

Author:

Colby Alexander Parsons <caparsons@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

53449a4

Parents:

accc5dbb

Message:

updated tests to reflect changes to collections

Location:

tests

Files:

• queue.cfa (modified) (2 diffs)
• sequence.cfa (modified) (2 diffs)
• stack.cfa (modified) (2 diffs)

tests/queue.cfa

@@ -13 +13 @@
         void ?{}( Fred & fred, int p ) with( fred ) {
                 i = p;
+        }
+        Fred *& Next( Fred * n ) {
+                return (Fred *)Next( (Colable *)n );
+        }
+
+        bool listed( Fred * n ) {
+                return Next( (Colable *)n ) != 0p;
         }
 
@@ -68 +75 @@
         }
 
+        Mary *& Next( Mary * n ) {
+                return (Mary *)Next( (Colable *)n );
+        }
+
+        bool listed( Mary * n ) {
+                return Next( (Colable *)n ) != 0p;
+        }
+
         Queue(Mary) mary;
         QueueIter(Mary) maryIter = { mary };

tests/sequence.cfa

@@ -13 +13 @@
         void ?{}( Fred & fred, int p ) with( fred ) {
                 i = p;
+        }
+
+        Fred *& Back( Fred * n ) {
+                return (Fred *)Back( (Seqable *)n );
+        }
+
+        Fred *& Next( Fred * n ) {
+                return (Fred *)Next( (Colable *)n );
+        }
+
+        bool listed( Fred * n ) {
+                return Next( (Colable *)n ) != 0p;
         }
 
@@ -76 +88 @@
         }
 
+        Mary *& Back( Mary * n ) {
+                return (Mary *)Back( (Seqable *)n );
+        }
+
+        Mary *& Next( Mary * n ) {
+                return (Mary *)Next( (Colable *)n );
+        }
+
+        bool listed( Mary * n ) {
+                return Next( (Colable *)n ) != 0p;
+        }
+
         Sequence(Mary) mary;
         Sequence(Mary) baz;

tests/stack.cfa

@@ -13 +13 @@
         void ?{}( Fred & fred, int p ) with( fred ) {
                 i = p;
+        }
+        Fred *& Next( Fred * n ) {
+                return (Fred *)Next( (Colable *)n );
+        }
+
+        bool listed( Fred * n ) {
+                return Next( (Colable *)n ) != 0p;
         }
 
@@ -68 +75 @@
         }
 
+        Mary *& Next( Mary * n ) {
+                return (Mary *)Next( (Colable *)n );
+        }
+
+        bool listed( Mary * n ) {
+                return Next( (Colable *)n ) != 0p;
+        }
+
         Stack(Mary) mary;
         StackIter(Mary) maryIter = { mary };