úÎp»      portable experimentalleon at melding-monads dot comReturns  I if the elements of a list occur in non-descending order, equivalent to  '(<=)' Returns  N if the predicate returns true for all adjacent pairs of elements in the list Returns  $ if the element appears in the list Returns  $ if the element appears in the list AInserts an element into a list, allowing for duplicate elements @Inserts an element into a list only if it is not already there. #Intersection of two ordered lists.  isect [1,3,5] [2,4,6] == []  isect [2,4,6,8] [3,6,9] == [6] ( isect [1,2,2,2] [1,1,1,2,2] == [1,2,2] Union of two ordered lists. ! union [1,3,5] [2,4,6] == [1..6] * union [2,4,6,8] [3,6,9] == [2,3,4,6,8,9] . union [1,2,2,2] [1,1,1,2,2] == [1,1,1,2,2,2]  Difference " minus [1,3,5] [2,4,6] == [1,3,5] $ minus [2,4,6,8] [3,6,9] == [2,4,8] $ minus [1,2,2,2] [1,1,1,2,2] == [2] Exclusive union " xunion [1,3,5] [2,4,6] == [1..6] ' xunion [2,4,6,8] [3,6,9] == [2,3,4,8] ) xunion [1,2,2,2] [1,1,1,2,2] == [1,1,2] Merge two ordered lists ( merge [1,3,5] [2,4,6] == [1,2,3,4,5,6] , merge [2,4,6,8] [3,6,9] == [2,3,4,6,6,8,9] 4 merge [1,2,2,2] [1,1,1,2,2] == [1,1,1,1,2,2,2,2,2] ;Returns true if the first list is a sub-list of the second "decorate-sort-undecorate, aka the "Schwartzian transform" ARecomputes instead; better for some things such as projections. :Equivalent to nub . sort, except somewhat more efficient @Equivalent to nub on ordered lists, except faster; on unordered M lists it also removes elements that are smaller than any preceding element.  nub [2,0,1,3,3] == [2,3]      !      !"#$%&'data-ordlist-0.0.1 Data.OrdListbase Data.ListsortsortByisSorted isSortedBymembermemberByhashasBy insertBag insertBagBy insertSet insertSetByisectisectByunionunionByminusminusByxunionxunionBymergemergeBysubsetsubsetBysortOnsortOn'nubSort nubSortBy nubSortOn nubSortOn'nubnubByghc-primGHC.BoolTrue