F <      Safe-InferredBWhen a list is non-null, pass it to a function, otherwise use the  default. "Get the union of the given lists. Opposite of map. (Maybe get the last element in the list. 3Return the first item of a list or something else. *Get the maximum of a list or return zero. DEssentially a powerset but retaining contiguously ordererd subsets. 4Merge two sorted lists into a single, sorted whole.  Example:  , merge [1,3,5] [1,2,4,6] -> [1,1,2,3,4,5,6] QuickCheck test property: prop_merge xs ys = 1 merge (sort xs) (sort ys) == sort (xs ++ ys) " where types = xs :: [Int] :Merge two sorted lists using into a single, sorted whole, <allowing the programmer to specify the comparison function. QuickCheck test property: prop_mergeBy xs ys = I mergeBy cmp (sortBy cmp xs) (sortBy cmp ys) == sortBy cmp (xs ++ ys) + where types = xs :: [ (Int, Int) ] 2 cmp (x1,_) (x2,_) = compare x1 x2 JReturns true if the given list contains any of the elements in the search list. GSimilar to Data.List.takeWhile, takes elements while the func is true. =The function is given the remainder of the list to examine. GSimilar to Data.List.dropWhile, drops elements while the func is true. =The function is given the remainder of the list to examine. ISimilar to Data.List.span, but performs the test on the entire remaining "list instead of just one element.  spanList p xs is the same as ((takeWhileList p xs, dropWhileList p xs) JSimilar to Data.List.break, but performs the test on the entire remaining "list instead of just one element. KGiven a list and a replacement list, replaces each occurance of the search 6list with the replacement list in the operation list.  Example:  +replace "," "." "127,0,0,1" -> "127.0.0.1" 'This could logically be thought of as: -replace old new l = join new . split old $ l Like 9, but works with a list of anything showable, converting it to a String.  Examples: / genericJoin ", " [1, 2, 3, 4] -> "1, 2, 3, 4" D genericJoin "|" ["foo", "bar", "baz"] -> "\"foo\"|\"bar\"|\"baz\"" EAdds the specified (key, value) pair to the given list, removing any 2existing pair with the same key already present. ARemoves all (key, value) pairs from the given list where the key matches the given one. GReturns the keys that comprise the (key, value) pairs of the given AL.  Same as: map fst DReturns the values the comprise the (key, value) pairs of the given AL.  Same as: map snd 6Indicates whether or not the given key is in the AL. DFlips an association list. Converts (key1, val), (key2, val) pairs to (val, [key1, key2]). @Converts an association list to a string. The string will have Pone pair per line, with the key and value both represented as a Haskell string. 8This function is designed to work with [(String, String)] association lists, (but may work with other types as well. The inverse of /, this function reads a string and outputs the appropriate association list. Like 1, this is designed to work with [(String, String)] association Hlists but may also work with other objects with simple representations. HReturns a count of the number of times the given element occured in the  given list. 8Returns the rightmost index of the given element in the  given list. 4Like elemRIndex, but returns -1 if there is nothing found. +Forces the evaluation of the entire list.  List of elements to look for List to search Result  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~          !"!#$%$&$'!()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijk$l$m$n$o$p$q$r$s$t$u$v$w$x$y$z${$|$}$~$$$$$$$$$$$$$$$$$$$ lists-0.4.0ListslistunionOffor lastToMaybefirstOrmaxList powerslicemergemergeByhasAny takeWhileList dropWhileListspanList breakListreplace genericJoinaddToAL delFromALkeysALvaluesALhasKeyALflipAL strFromALstrToAL countElem elemRIndexalwaysElemRIndexseqListbase Data.List intercalateGHC.Base++foldrGHC.Listconcatfilterzipmapunwordswordsunlineslinesproductsumfoldl1'foldl1foldl'unfoldrsortBysort permutations subsequencestailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLength minimumBy maximumByminimummaximuminsertByinsert mapAccumR mapAccumL partition transpose intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub isInfixOf isSuffixOf isPrefixOf findIndices findIndexfind elemIndices elemIndex stripPrefix dropWhileEndunzip3unzipzipWith3zipWithzip3!! concatMaplookupnotElemelemallanyorandreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrfoldr1scanl1scanlfoldllengthnullinitlasttailheadlist-extras-0.4.1.1Data.List.Extras.LazyLength lengthCompare lengthBoundData.List.Extras.Pairbiject'bijectpairpairBypairWith pairWithByzipBy zipWithByData.List.Extras.ArgmaxargminsWithMin argminWithMinargminsargminargmaxesWithMax argmaxWithMaxargmaxesargmaxargmaxesWithMaxByargmaxWithMaxBy argmaxesByargmaxBy catchNull split-0.2.2Data.List.Split.InternalschopsplitPlacesBlanks splitPlaces splitEverychunkchunksOflinesBywordsBy unintercalate endByOneOfendBy sepByOneOfsepBy splitWhensplitOn splitOneOf endsWithOneOfendsWithstartsWithOneOf startsWith dropBlanksdropInnerBlanksdropFinalBlank dropInitBlankcondense keepDelimsR keepDelimsL dropDelimswhenElt onSublistoneOfsplitdefaultSplitterSplitter