44970
|
1 |
{-# LANGUAGE EmptyDataDecls, RankNTypes, ScopedTypeVariables #-}
|
29297
|
2 |
|
28421
|
3 |
module Example where {
|
|
4 |
|
48501
|
5 |
import Prelude ((==), (/=), (<), (<=), (>=), (>), (+), (-), (*), (/),
|
|
6 |
(**), (>>=), (>>), (=<<), (&&), (||), (^), (^^), (.), ($), ($!), (++),
|
|
7 |
(!!), Eq, error, id, return, not, fst, snd, map, filter, concat,
|
|
8 |
concatMap, reverse, zip, null, takeWhile, dropWhile, all, any, Integer,
|
|
9 |
negate, abs, divMod, String, Bool(True, False), Maybe(Nothing, Just));
|
|
10 |
import qualified Prelude;
|
|
11 |
|
29798
|
12 |
data Queue a = AQueue [a] [a];
|
28421
|
13 |
|
39210
|
14 |
empty :: forall a. Queue a;
|
|
15 |
empty = AQueue [] [];
|
28421
|
16 |
|
39210
|
17 |
dequeue :: forall a. Queue a -> (Maybe a, Queue a);
|
|
18 |
dequeue (AQueue [] []) = (Nothing, AQueue [] []);
|
|
19 |
dequeue (AQueue xs (y : ys)) = (Just y, AQueue xs ys);
|
|
20 |
dequeue (AQueue (v : va) []) =
|
31848
|
21 |
let {
|
37610
|
22 |
(y : ys) = reverse (v : va);
|
39210
|
23 |
} in (Just y, AQueue [] ys);
|
28421
|
24 |
|
39210
|
25 |
enqueue :: forall a. a -> Queue a -> Queue a;
|
|
26 |
enqueue x (AQueue xs ys) = AQueue (x : xs) ys;
|
28421
|
27 |
|
|
28 |
}
|