úÎb"      Safe-InferredNType of sorted lists. Any (non-bottom) value of this type is a sorted list. Check if a sorted list is empty.cDecompose a sorted list into its minimal element and the rest. If the list is empty, it returns . Create a  by sorting a regular list.Create a list from a 2. The returned list is guaranteed to be sorted.O(1)-. Create a sorted list with only one element.FAn infinite list with all its elements equal to the given argument.3Replicate a given number of times a single element.¦Create a sorted list by repeatedly applying the same function to an element, until the image by that function is stricly less than its argument. In other words: %iterate f x = [x, f x, f (f x), ... ]!With the list ending whenever 1f (f (... (f (f x)) ...)) < f (... (f (f x)) ...)6. If this never happens, the list will be infinite. O(n)(. Insert a new element in a sorted list. <Extract the prefix with the given length from a sorted list. rDrop the given number of elements from a sorted list, starting from the smallest and following ascending order. žSplit a sorted list in two sublists, with the first one having length equal to the given argument, except when the length of the list is less than that. O(n)<. Extract the elements of a list that satisfy the predicate.O(n)!. An efficient implementation of  , using the £ instance of the elements in a sorted list. It only traverses the whole list if the requested element is greater than all the elements in the sorted list.O(n)/. Remove duplicate elements from a sorted list.         sorted-list-0.1.1.0Data.SortedList SortedListnulluncons toSortedListfromSortedList singletonrepeat replicateiterateinserttakedropsplitAtfilterelemOrdnubbase Data.MaybeNothingGHC.Listelemghc-prim GHC.ClassesOrdmergeSortedLists$fFoldableSortedList$fMonoidSortedList$fShowSortedList