1cj      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                      None 9:;<=DR is a strict wrapper around Data.Vector.Mutable's   LNone/0QR        None 02345DHRT !"#    !"#  !"#  5 5None 0234AIT3$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRST,$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNO,$%(+-./1245)6:;9=>?@<ABC7FGHIJKLM,N&'ED8*03O1$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTNone04AITC[\]^_`abcdefghijklmnopqrstuvwxyz{|}~<[\]^_`abcdefghijklmnopqrstuvwxyz{|}~<[\_aghijkmncdefbzop`qvwty{|}ux~rls^]A[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ Safe$234<=bSafe 9;<=DORTbG !"#$%&'))F !"#$%&'None02345$maybeToOption (optionToMaybe x) == x0     0     +     None $DHQRT" null (sl [])Truenull (sl ["foo"])False#%not (null xs) ==> isSome (headOpt xs)%Safe ( function: Returns  for an empty list,  x$ for a non-empty list starting with x.(optionToStrictList (Some "foo")["foo"]optionToStrictList None[])maybeToStrictList (Just "bar")["bar"]maybeToStrictList Nothing[]+drop 3 (sl [1, 2, 3, 4, 5])[4,5],, idx removes the element at index idx.5not (null xs) ==> Some (deleteIdx 0 xs) == tailOpt xs-- x! removes the first occurrence of xE from its list argument. NOTE: Implementation copied from Data.List..The . function behaves like -], but takes a user-supplied equality predicate. NOTE: Implementation copied from Data.List.5Equivalent of  with .6Equivalent of  with .7Equivalent of  with .8Equivalent of  with  and .LmapOption (\x -> if even x then Some (x * 2) else None) (sl [1, 2, 3, 4, 5])[4,8]9Equivalent to  with  and .BcatOptions (sl [Some 1, None, Some 2, None, None, Some 3, Some 4]) [1,2,3,4]:>catOptionsL [Some 1, None, Some 2, None, None, Some 3, Some 4] [1,2,3,4];!take 3 (sl [1, 2, 3, 4, 5, 6, 7])[1,2,3]=7sortOn snd (sl [("foo", 10), ("bar", 1), ("baz", 100)])"[("bar",1),("foo",10),("baz",100)]?reverse (reverse xs) == xs]*lookupM'' showKey getKey getValue key list searches for key in list using getKey$ as the key extraction function and showKey5 to print all available keys when no match is found.kAppends an element to the end of this list. This is really inefficient because the whole list needs to be copied. Use at your own risk.P !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV)WXYZ[\]^_`abcdefghijklmnW !"# !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnW mKJ/D69:EFGHIV-.,+0cL5N1"#W$#`aZYX'&!!_^\]23478d)eMn"(b>?[ k@A<B=Cfg%;*lhjiORQPSTUP !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUV)WXYZ[\]^_`abcdefghijklmnNone 09:;<=DIRpO(1) Yield the length of the vector.qO(1) Test whether a vector if emptyr O(1) IndexingsO(1) Safe indexingtO(1) First elementuO(1) Last elementReturns *D the only element of the vector if there is exactly one element or + otherwise.,:Copied from Data.Vector.Generic as it isn't exported there7o-pqrstuvwxyz{|}~./,0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~opqrstuvwxyz{|}~%oqprstuvwxzy{|}~6o-pqrstuvwxyz{|}~./, Safe0 is a version of  that is strict on both the  side (called  ) and the  side (called ).Note: $ is not used as an error monad. Use  for that.Choice' s version of !this (This "foo") :: Maybe String Just "foo"!this (That "bar") :: Maybe StringNothing!that (This "foo") :: Maybe StringNothing!that (That "bar") :: Maybe String Just "bar"7these [This "foo", This "bar", That "baz", This "quux"]["foo","bar","quux"]7those [This "foo", This "bar", That "baz", This "quux"]["baz"]eitherToChoice (Left 1)This 1eitherToChoice (Right 5)That 5&mergeChoice (This 5 :: Choice Int Int)5*mergeChoice (That 'c' :: Choice Char Char)'c'    !"#$%&'()*+,-./0 1 2 3 4 5 6 7 89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmn:op=>@qrstuBCDEFvGHIJKLMaNOPQwRSTUVXZ\Y[]^`xy_z{|}~          S  CG !"#$%&'()*+,-./0123456789:;<H=>q@B?@ABCDEFGHIJKLM6SNOPQDRFH=STUVWXYZ[\A]^_$9`abcdefghijklmnopqrstuvwxy z { | } ~                 !_ S6              9n M      !"#$%&'()*+,-./0123456789:;,-<=>?@ABCDEFGHIJ0/.&%@KLMNOPQRFSTUVWXYZ1[\]^_`abc5def)gGhij!klmnopq_rstuvw'xIyz{|}~  *strict-data-0.2.0.2-FGPF9cVJpblGQAsBKh3DLB Data.FailData.StrictTupleData.StrictVector.MutableData.StrictListData.Map.UnorderedData.Map.Ordered Data.OptionData.StrictVector Data.ChoiceData.Vector.MutableMVectorData.StrictList.TypesData.Fail.TypesPreludefilter Data.Maybe catMaybesmapMaybeFailbaseControl.Monad.Fail MonadFail Data.TupleswapSTVectorIOVector$fMVectorMVectora toLazyTuple fromLazyTuplefst'snd'uncurry'firstsecondswap'fst3snd3thr3fst3'snd3'thr3'$fFromJSONPair $fToJSONPair$fArbitraryPair $fMonoidPair $fNFDataPair$fHashablePair $fDataPair StrictListNil:!SL+!+length fromLazyList toLazyListUSMapMap toHashMap fromHashMapemptymember lookupDefaultlookuplookup'insertdeletefromList fromListWithtoListmap singleton insertWithelemskeyskeysSetunion unionWith difference intersectionfindWithDefaultsizenull isSubmapOf foldrWithKey foldlWithKey foldlWithKey' filterWithKeyinsertLookupWithKeyupdateLookupWithKeyadjust deleteLookupassocs insertWith'updatealterunions unionsWith$fArbitraryUSMap $fNFDataUSMap$fHashableUSMap $fShowUSMap $fReadUSMap $fEqUSMap$fFunctorUSMap$fFoldableUSMap$fTraversableUSMap $fDataUSMap $fMonoidUSMapOSMap fromDataMap toDataMaplookupMlookupLTlookupGTlookupLElookupGE toDescListelemAtdifferenceWith updateWithKey insertWithKeyinsertWithKey'mapKeysmaxViewmaxViewWithKeyminViewminViewWithKeyintersectionWithfromDistinctAscListhasValuehasKey $fMonoidOSMap$fTraversableOSMap$fArbitraryOSMap$fFunctorOSMap$fHashableOSMap $fEqOSMap $fOrdOSMap $fReadOSMap $fShowOSMap$fFoldableOSMap $fNFDataOSMap $fDataOSMapFIOFailTErrOk MonadFailure catchFailureisFailisOk failSwitchrunFailT failMaybe failEitherStrfailEitherTextfailEitherShowrunExceptTFailfailInMfailInM' failInM''mapFail failToEither failToMaybefailForIOExceptioncatFailsfromFailfromFailStringrunErrorpartitionFails eitherToError errorToEithererrorToDefault liftError errorToMaybe maybeToError maybeToFail eitherToFailrunExceptTorFail safeFromOk$fMonadFailureReaderT$fMonadFailureFailT$fMonadFailureFail$fMonadFailureIO$fMonadFailureMaybe$fMonadError[]Fail$fMonadPlusFailT$fAlternativeFailT$fApplicativeFailT$fMonadFailFailT $fMonadFailT$fMonadFixFailT$fMonadFixFail$fAlternativeFail$fApplicativeFail$fMonadPlusFail$fMonadFailFail $fMonadFail$fMonadWriterwFailT$fMonadResourceFailT$fMonadStatesFailT$fMonadIOFailT$fMonadTransFailT$fMonadError[]FailT$fMonadTransControlFailT$fMonadBaseControlbFailT$fMonadBasebFailT$fMonadThrowFailT$fArbitraryFail ToOptionToptionTOptionT runOptionTOptionNoneSome runOptionTDefnoneIf fromOptionisSomeisNone optionToMaybe maybeToOption optionToList optionToSL listToOption getSomeNoteoption catOptions mapOption forOptionM mapOptionM safeFromSome failToOption optionToFail optionToFailT$fHashableOption$fArbitraryOption$fMonadFailOption$fMonadIOOptionT$fMonadTransOptionT$fNFDataOption $fOrdOption$fMonadOptionT$fMonadFailOptionT$fApplicativeOptionT$fFunctorOptionT$fToOptionTOption$fToOptionTMaybe$fFromJSONOption$fToJSONOption$fMonadPlusOption$fAlternativeOption$fMonoidOption $fMonadOption$fApplicativeOption $fShowOption $fReadOption $fEqOption$fGenericOption $fDataOption$fFunctorOption$fFoldableOption$fTraversableOptionslllheadOptheadMtailOptlastOptlastMoptionToStrictListmaybeToStrictList takeWhiledrop deleteIdxdeleteByatIdx dropWhile findIndexmapMmapM_ catOptionsLtakesortsortOn replicatereversemergemergeBysortByspanbreakconcatconcatSL concatMap concatMapSL concatMapManyallelemnotElemfindzipzipSLzipLSzipLLzipWith zipWithLS zipWithSL concatTextgroupBy intersperseintercalateTextintercalateStringlookupM' lookupM''insertBy partition dropWhileEndmaximumM mconcatSL stripPrefix stripSuffixunzipunzipLLunzipLsnoc transpose\!\nubVector!!?headlast fromListNgenerate generateMfromSLtoSLlastMayuncons theOnlyOne lookAround toHashSetdropWhileLookingAroundimapM binarySearchL binarySearchRgroupOnunfoldrM unfoldrNM updateVectorupdateVectorWith$fFromJSONVector$fIsListVector$fTraversableVector$fAlternativeVector$fApplicativeVector$fMonadPlusVector $fMonadVector$fMonadFailVector$fFunctorVector$fArbitraryVector$fHashableVector $fReadVector $fShowVector$fVectorVectora $fEqVector $fOrdVector$fNFDataVector$fToJSONVector$fMonoidVector$fFoldableVector $fDataVectorChoiceThisThatchoicethisthatthesethoseeitherToChoice mergeChoice$fNFDataChoice$fArbitraryChoice $fMonadChoice$fFunctorChoice$fApplicativeChoice$fHashableChoice$fBifunctorChoice $fEqChoice $fOrdChoice $fReadChoice $fShowChoice $fDataChoice&vector-0.12.0.1-BtK5bVORdhu8bC6gqUfFYiData.Vector.Generic.MutablenextPermutationpartitionBundleunstablePartitionBundleunstablePartition unsafeUpdate unsafeAccumaccum unsafeMove unsafeCopymovecopysetunsafeExchange unsafeSwap unsafeModify unsafeWrite unsafeReadexchangemodifywritereadclearunsafeGrowFront unsafeGrow growFrontgrowclone replicateM unsafeNewnewoverlaps unsafeDrop unsafeTake unsafeTail unsafeInit unsafeSlicetailinitsplitAtslice munstreamR unstreamR vunstream munstreamunstream transformRfillRmstreamR transformfillmstream Data.Vector.Generic.Mutable.Base basicLengthbasicUnsafeSlice basicOverlapsbasicUnsafeNewbasicInitializebasicUnsafeReplicatebasicUnsafeReadbasicUnsafeWrite basicClearbasicSetbasicUnsafeCopybasicUnsafeMovebasicUnsafeGrow#strict-0.3.2-BBOmnAYVsBNJUoZDQOsWvMData.Strict.TupleuncurrycurryPair:!:prop_StrictListOrd$fIsListStrictList$fNFDataStrictList$fFromJSONStrictList$fToJSONStrictList$fHashableStrictList$fMonoidStrictList$fArbitraryStrictList$fMonadStrictList$fMonadFailStrictList$fAlternativeStrictList$fApplicativeStrictList$fShowStrictList$fReadStrictListunUSMapunOSMapunFailTmapFailT throwFailT catchFailTfailBindfailApfailZerofailPlus returnFailT bindFailTGHC.List concatStringGHC.BaseJustNothing unstreamMhashVectorWithSalt maybeToVectorData.Vector.GenericdataCastmkTypegfoldl liftReadsPrecreadPrec liftShowsPrec showsPreccmpBycmpeqByeqstreamRstreamthaw unsafeThawfreeze unsafeFreezeconvertscanr1'scanr1iscanr'iscanrscanr'scanr postscanr' postscanr prescanr'prescanrscanl1'scanl1iscanl'iscanlscanl'scanl postscanl' postscanl prescanl'prescanl sequence_sequencefold1M'_ifoldM'_foldM'_fold1M_ifoldM_foldM_fold1M'ifoldM'foldM'fold1MifoldMfoldM minIndexByminIndex maxIndexBymaxIndex minimumByminimum maximumBymaximumproductsumorandifoldr'ifoldrifoldl'ifoldlfoldr1'foldr'foldr1foldrfoldl1'foldl'foldl1foldl elemIndices elemIndex findIndicesfilterM imapMaybeuniqifilterunzip6unzip5unzip4unzip3 izipWithM_ zipWithM_ izipWithMzipWithMzip6zip5zip4zip3 izipWith6 izipWith5 izipWith4 izipWith3izipWithzipWith6zipWith5zipWith4zipWith3forM_forMimapM_imapindexedunsafeBackpermute backpermuteunsafeAccumulate_unsafeAccumulate accumulate_ accumulate unsafeUpdate_ unsafeUpdupdate_//forcecreateTcreate iterateNMconcatNE++consenumFromThenTo enumFromTo enumFromStepN enumFromN constructrN constructNunfoldrNunfoldriterateN unsafeLastM unsafeHeadM unsafeIndexMindexM unsafeLast unsafeHead unsafeIndexData.Vector.Generic.BaseMutablebasicUnsafeFreezebasicUnsafeThawbasicUnsafeIndexMelemseq Data.EitherEitherLeftRighteither