1 implementation module StdSortList
5 :: SortList a = SortList (SortList a, a, SortList a) | Empty
7 newSortList :: SortList a
10 memberSort :: a (SortList a) -> Bool | Eq, Ord a
11 memberSort x Empty = False
12 memberSort x (le, el, gr)
14 | x < el = memberSort x le
15 | otherwise = memberSort x gr
17 insertSort :: a (SortList a) -> SortList a | Ord a
18 memberSort x Empty = Sortlist (Empty, x, Empty)
19 memberSort x (le, el, gr)
21 removeFirst :: a (SortList a) -> SortList a | Eq, Ord a
22 removeFirst e ([], _)_ = ([], _)
24 removeAll :: a (SortList a) -> SortList a
27 elements :: (SortList a) -> [a]
30 count :: (SortList a) -> Int
33 minimum :: (SortList a) -> a
36 maximum :: (SortList a) -> a
39 mergeSortList :: (SortList a) (SortList b) -> (SortList a)
40 mergeSortList _ _ = Empty