úÎ' ê      Safe-Inferred+<Singals that an element with a negative index was accessed. cSignals that the list was empty or contained too few elements (in the case or access by index). RTakes a function that requires a non-empty list and wraps it in an instance of . For empty lists, an  is thrown. :Extract the first element of a list. Empty lists throw an . 9Extract the last element of a list. Empty lists throw an . GExtract the elements after the head of a list. Empty lists throw an . OReturn all the elements of a list except the last one. Empty lists throw an .   is a variant of b that has no starting value, and thus must be applied to non-empty lists. Empty lists throw an . A strict version of  .   is a variant of b that has no starting value, and thus must be applied to non-empty lists. Empty lists throw an .  | returns the maximum value from a list, which must be non-empty, finite, and of an ordered type. It is a special case of b, which allows the programmer to supply their own comparison function. Empty lists throw an .  | returns the maximum value from a list, which must be non-empty, finite, and of an ordered type. It is a special case of b, which allows the programmer to supply their own comparison function. Empty lists throw an . The ¼ function takes a comparison function and a list and returns the greatest element of the list by the comparison function. The list must be finite and non-empty. Empty lists throw an . The ¹ function takes a comparison function and a list and returns the least element of the list by the comparison function. The list must be finite and non-empty. Empty lists throw an . IList index (subscript) operator, starting from 0. Indices larger than  length xs - 1 throw an , negative indices throw an .  u !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvw   x      ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^_`abcdefghijklmnopqrstuvwxyz{|}~listsafe-0.1.0.0Data.List.SafeNegativeIndexExceptionEmptyListExceptionwrapheadlasttailinitfoldl1foldl1'foldr1maximumminimum maximumBy minimumBy!!exceptions-0.6.1Control.Monad.Catch MonadThrowbaseGHC.ListfoldlGHC.Basefoldr!$fExceptionNegativeIndexException$fExceptionEmptyListException++concatfilterzipmap Data.Listunwordswordsunlineslinesproductsumfoldl'unfoldrsortBysort permutations subsequencestailsinitsgroupBygroupdeleteFirstsByunzip7unzip6unzip5unzip4zipWith7zipWith6zipWith5zipWith4zip7zip6zip5zip4genericReplicate genericIndexgenericSplitAt genericDrop genericTake genericLengthinsertByinsert mapAccumR mapAccumL partition transpose intercalate intersperse intersectBy intersectunionByunion\\deleteBydeletenubBynub isInfixOf isSuffixOf isPrefixOf findIndices findIndexfind elemIndices elemIndex stripPrefix dropWhileEndunzip3unzipzipWith3zipWithzip3 concatMaplookupnotElemelemallanyorandreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanllengthnull