1 implementation module StdSortList
7 newSortList :: (SortList a)
10 memberSort :: a (SortList a) -> Bool | Eq, Ord a // is element van
11 memberSort _ [] = False
15 | otherwise = memberSort m (tl l)
17 insertSort :: a (SortList a) -> SortList a | Ord a // voeg element toe
18 insertSort m l = insertSort` newSortList m l
20 insertSort` :: (SortList a) a (SortList a) -> (SortList a) | Ord a
22 | count l2 == 0 = l1 ++ [m]
23 | minimum l2 >= m = l1 ++ [m] ++ l2
24 | otherwise = insertSort` (l1 ++ [hd l2]) m (tl l2)
26 removeFirst :: a (SortList a) -> SortList a | Eq, Ord a // verwijder eerste voorkomen
27 removeFirst m l = removeFirst` newSortList m l
29 removeFirst` :: (SortList a) a (SortList a) -> (SortList a) | Eq, Ord a
32 | minimum l2 > m = l1 ++ l2
33 | minimum l2 == m = l1 ++ tl l2
34 | otherwise = removeFirst` (l1 ++ [hd l2]) m (tl l2)
36 removeAll :: a (SortList a) -> SortList a | Eq, Ord a // verwijder alle voorkomens
37 removeAll m l = removeAll` newSortList m l
39 removeAll` :: (SortList a) a (SortList a) -> (SortList a) | Eq, Ord a
42 | minimum l2 > m = l1 ++ l2
43 | minimum l2 == m = removeAll` l1 m (tl l2)
44 | otherwise = removeAll` (l1 ++ [hd l2]) m (tl l2)
46 elements :: (SortList a) -> [a] // geef alle elementen
49 count :: (SortList a) -> Int // aantal elementen
52 minimum :: (SortList a) -> a // huidige minimum waarde
55 maximum :: (SortList a) -> a // huidige maximum waarde
58 mergeSortList :: (SortList a) (SortList a) -> SortList a | Eq, Ord a // meng gesorteerde lijsten
59 mergeSortList l1 [] = l1
60 mergeSortList l1 l2 = mergeSortList (insertSort (hd l2) l1) (tl l2)