Îõ³h*"‘a”      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€  ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ  Ž   ‘ ’ “ 1.4.1.0  Safe-Inferred miniA map from keys k to values a&, internally structured as an AVL tree”mini Empty bin•miniLeft-heavy bin–mini Balanced bin—miniRight-heavy bin˜miniPrimitive recursion on mapsminiO(1) The empty mapmini O(n log n)' Make a map from a tail-biased list of  (key, value) pairsminiO(1) Make a map with a single binmini O(n log n)+ Subtract a map by another via key matchingmini O(n log n): Intersect a map with another via left-biased key matchingmini O(n log n)6 Unite a map with another via left-biased key matchingminiO(n) Turn a map into a list of  (key, value) pairs in ascending orderminiO(n) Turn a map into a list of  (key, value) pairs in descending order miniO(n) Reduce a map with a left-associative operation and an accumulator miniO(n)à Reduce a map with a right-associative operation and an accumulator miniO(log n)5 Adjust with an operation the value of a key in a map miniO(log n) Delete a key from a map miniO(n)/ Keep the bins whose values satisfy a predicateminiO(n)8 Keep the bins whose keys and values satisfy a predicateminiO(log n)> Insert a key and its value into a map, overwriting if presentminiO(log n)> Modify the value of a key or delete its bin with an operationmini O(n log n)5 Check whether the bins of one map exist in the otherminiO(log n)' Fetch the value of a key in a map, or ™ if absentminiO(log n)( Fetch the bin with the maximum key, or ™ if emptyminiO(log n)( Fetch the bin with the minimum key, or ™ if emptyminiO(log n) Check whether a key is in a mapminiO(1) Check whether a map is emptyminiO(n) Get the size of a mapminiO(n)7 Lift a map with a lifting operation on keys and valuesminiO(n)> Check whether a map is internally height-balanced and ordered˜mini Empty binminiLeft-heavy binmini Balanced binminiRight-heavy binminiMap   Safe-Inferredò"mini"A set containing elements of type a&, internally structured as an AVL treešmini Empty node›miniLeft-heavy nodeœmini Balanced nodeminiRight-heavy nodežminiPrimitive recursion on sets#miniO(1) The empty set$mini O(n log n)# Make a set from a list of elements%miniO(1)! Make a set with a single element&mini O(n log n) Subtract a set by another'mini O(n log n) Intersect a set with another(mini O(n log n) Unite a set with another)miniO(n)6 Turn a set into a list of elements in ascending order*miniO(n)7 Turn a set into a list of elements in descending order+miniO(log n) Delete an element from a set,miniO(n)) Keep the elements satisfying a predicate-miniO(log n) Insert an element into a set.mini O(n log n)7 Check whether the elements of a set exist in the other/miniO(log n) Fetch the maximum element, or ™ if the set is empty0miniO(log n) Fetch the minimum element, or ™ if the set is empty1miniO(log n)% Check whether an element is in a set2miniO(1) Check whether a set is empty3miniO(n) Get the size of a set4miniO(n)> Check whether a set is internally height-balanced and orderedžmini Empty nodeminiLeft-heavy nodemini Balanced nodeminiRight-heavy nodeminiSet"#$%&'()*+,-./01234"#$%&'()*+,-./01234 Safe-InferredØÝ»;mini%A reference updating structures from s to t and fields from a to b<mini&Make a lens from a getter and a setter=mini5Fetch the field referenced by a lens from a structure>miniÆUpdate the field referenced by a lens with an operation on a structure?miniÄOverwrite the field referenced by a lens with a value on a structure;<=>?;<=>? Safe-Inferred®@mini,Instances should satisfy the following laws: lift . pure = pure &lift (m >>= f) = lift m >>= (lift . f)AminiÀLift a computation from the inner monad to the transformer monad@A@A Safe-InferredÁBmini*A terminable transformer with termination e, inner monad m , return aDmini Unwrap an B computationEmini&Terminate the computation with a valueFmini$Run a computation and get its resultBCDEFBCDEF Safe-InferredÆLmini*A terminable transformer with inner monad m , return aNmini Unwrap a L computationOmini)Terminate the computation without a valuePmini$Run a computation and get its resultLMNOPLMNOP Safe-InferredÕä¯Vmini A parse errorYminiA transformer parsing symbols s, inner monad m , return a[mini Unwrap a Y0 computation with a sequence of symbols to parse\mini$Parse symbols satisfying a predicate]miniParse any symbol^miniParse a symbol_miniParse a sequence of symbols`mini&Parse symbols included in a collectionamini(Parse symbols excluded from a collectionbmini'Parse successfully only at end of inputcmini*Parse the next symbol without consuming itdminiParse zero or more p separated by q via  p `sepBy` qeminiParse one or more p separated by q via  p `sepBy1` qfminiParse zero or more p until q succeeds via  p `till` qgminiParse one or more p left-associatively chained by f via  chainl1 p fhminiParse one or more p right-associatively chained by f via  chainr1 p fiminiParse p enclosed by a and b via  between a b pjminiParse p returning a in case of failure via  option a pkminiParse p, without consuming input, iff p fails via reject plminiParse p, without consuming input, iff p succeeds via accept pominiCombine the results of p and q via p <> qrminiParse p or, if p fails, backtrack and parse q via p <|> qYZ[VWX\]^_`abcdefghijklYZVWX[\]^_`abcdefghijkl Safe-InferredþvminiA transformer with read-only r, inner monad m , return axmini Unwrap a v, computation with an initial read-only valueyminiFetch the read-only environmentzmini+Run a computation in a modified environmentvwxyzvwxyz  Safe-InferredÕM€miniA transformer with state s, inner monad m , return a‚mini Unwrap a €" computation with an initial stateƒminiFetch the current state„mini*Update the current state with an operation…mini(Overwrite the current state with a value€‚ƒ„…€‚ƒ„…  Safe-InferredÕM‹mini'A transformer with monoidal write-only w, inner monad m , return amini Unwrap a ‹ computationŽmini,Append a value to the write-only environment‹ŒŽ‹ŒŽŸ   !"#$%&'()*+,-. / !"#%0123456789:;<==>?@ABCDEFFGH@IJKLMNNOPPQRSTUVWXYZ[\]^_`abcdefghijkllmnopqrst u u v w x y z { | } ~   €  ‚ ƒ „ … †‡ˆ‰Š‹ŒŽ‡ˆ‰Š:#mini-1.4.1.0-DlZuonvGCph7JyPdC9T1Ae Mini.Data.Map Mini.Data.SetMini.Optics.LensMini.Transformers.ClassMini.Transformers.EitherTMini.Transformers.MaybeTMini.Transformers.ParserTMini.Transformers.ReaderTMini.Transformers.StateTMini.Transformers.WriterTminiMapemptyfromList singleton difference intersectionunion toAscList toDescList foldlWithKey foldrWithKeyadjustdeletefilter filterWithKeyinsertupdate isSubmapOflookup lookupMax lookupMinmembernullsizetraverseWithKeyvalid $fMonoidMap$fSemigroupMap$fTraversableMap $fFoldableMap $fFunctorMap $fShowMap$fOrdMap$fEqMapSet isSubsetOf $fMonoidSet$fSemigroupSet $fFoldableSet $fShowSet$fOrdSet$fEqSetLenslensviewoverset MonadTransliftEitherT runEitherTleft anticipate$fMonadTransEitherT$fMonadEitherT$fAlternativeEitherT$fApplicativeEitherT$fFunctorEitherTMaybeT runMaybeTnothing$fMonadTransMaybeT $fMonadMaybeT$fAlternativeMaybeT$fApplicativeMaybeT$fFunctorMaybeT ParseError unexpectedParserT runParserTsatitemsymbolstringoneOfnoneOfeofpeeksepBysepBy1tillchainl1chainr1betweenoptionrejectaccept$fMonadFailParserT$fMonoidParserT$fSemigroupParserT$fMonadTransParserT$fMonadParserT$fAlternativeParserT$fApplicativeParserT$fFunctorParserT$fShowParseErrorReaderT runReaderTasklocal$fMonadTransReaderT$fMonadReaderT$fAlternativeReaderT$fApplicativeReaderT$fFunctorReaderTStateT runStateTgetmodifyput$fMonadTransStateT $fMonadStateT$fAlternativeStateT$fApplicativeStateT$fFunctorStateTWriterT runWriterTtell$fMonadTransWriterT$fMonadWriterT$fAlternativeWriterT$fApplicativeWriterT$fFunctorWriterTELBRmapbase GHC.MaybeNothing