implementation module StdSortList

import StdEnv

::  SortList a = SortList (SortList a, a, SortList a) | Empty

newSortList :: SortList a
newSortList = Empty

memberSort :: a (SortList a) -> Bool | Eq, Ord a
memberSort x Empty = False
memberSort x (le, el, gr)
| x == e = True
| x < el = memberSort x le
| otherwise = memberSort x gr

insertSort :: a (SortList a) -> SortList a | Ord a
memberSort x Empty = Sortlist (Empty, x, Empty)
memberSort x (le, el, gr)

removeFirst :: a (SortList a) -> SortList a | Eq, Ord a
removeFirst e ([], _)_ = ([], _)

removeAll :: a (SortList a) -> SortList a
removeAll _ _ = Empty

elements :: (SortList a) -> [a]
elements _ = []

count :: (SortList a) -> Int
count _ = 0

minimum :: (SortList a) -> a
minimum _ = 0

maximum :: (SortList a) -> a
maximum _ = 0

mergeSortList :: (SortList a) (SortList b) -> (SortList a)
mergeSortList _ _ = Empty

Start :: String
Start = newSortList