| 28421 |      1 | module Example where {
 | 
|  |      2 | 
 | 
|  |      3 | 
 | 
|  |      4 | foldla :: forall a b. (a -> b -> a) -> a -> [b] -> a;
 | 
|  |      5 | foldla f a [] = a;
 | 
|  |      6 | foldla f a (x : xs) = foldla f (f a x) xs;
 | 
|  |      7 | 
 | 
|  |      8 | rev :: forall a. [a] -> [a];
 | 
|  |      9 | rev xs = foldla (\ xsa x -> x : xsa) [] xs;
 | 
|  |     10 | 
 | 
|  |     11 | list_case :: forall t a. t -> (a -> [a] -> t) -> [a] -> t;
 | 
|  |     12 | list_case f1 f2 (a : list) = f2 a list;
 | 
|  |     13 | list_case f1 f2 [] = f1;
 | 
|  |     14 | 
 | 
|  |     15 | data Queue a = Queue [a] [a];
 | 
|  |     16 | 
 | 
|  |     17 | empty :: forall a. Queue a;
 | 
|  |     18 | empty = Queue [] [];
 | 
|  |     19 | 
 | 
|  |     20 | dequeue :: forall a. Queue a -> (Maybe a, Queue a);
 | 
|  |     21 | dequeue (Queue [] []) = (Nothing, Queue [] []);
 | 
|  |     22 | dequeue (Queue xs (y : ys)) = (Just y, Queue xs ys);
 | 
|  |     23 | dequeue (Queue (v : va) []) =
 | 
|  |     24 |   let {
 | 
|  |     25 |     (y : ys) = rev (v : va);
 | 
|  |     26 |   } in (Just y, Queue [] ys);
 | 
|  |     27 | 
 | 
|  |     28 | enqueue :: forall a. a -> Queue a -> Queue a;
 | 
|  |     29 | enqueue x (Queue xs ys) = Queue (x : xs) ys;
 | 
|  |     30 | 
 | 
|  |     31 | }
 |