Ξυ³h*'Ό$;’      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ   ‘ ’ “ ” • – — ˜ ™ š › œ  ž Ÿ   ‘ 1.4.2.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) pairsmini O(n log n)9 Make a map from a list of pairs, combining matching keysmini O(n log n)9 Make a map from a list of pairs, combining matching keysminiO(1) Make a map with a single binmini O(m log n)+ Subtract a map by another via key matchingmini O(n log m): Intersect a map with another via left-biased key matchingmini O(m log n)6 Unite a map with another via left-biased key matching miniO(n) Turn a map into a list of  (key, value) pairs in ascending order miniO(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 mapminiO(log n) Delete a key from a mapmini O(n log n)/ Keep the bins whose values satisfy a predicatemini O(n log 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)= Insert a key and its value, combining new and old if presentminiO(log n)= Insert a key and its value, combining new and old if presentminiO(log n)> Modify the value of a key or delete its bin with an operationmini O(n log m)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)3 Fetch the least bin greater than or equal to a keyminiO(log n)0 Fetch the least bin strictly greater than a keyminiO(log n)3 Fetch the greatest bin less than or equal to a keyminiO(log n)0 Fetch the greatest bin strictly less than a keyminiO(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 map miniO(n)7 Lift a map with a lifting operation on keys and values!miniO(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 node«miniRight-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(m log n) Subtract a set by another/mini O(m log n) Intersect a set with another0mini O(m log n) Unite a set with another1miniO(n)6 Turn a set into a list of elements in ascending order2miniO(n)7 Turn a set into a list of elements in descending order3miniO(log n) Delete an element from a set4mini O(n log n)) Keep the elements satisfying a predicate5miniO(log n) Insert an element into a set6mini O(n log m)7 Check whether the elements of a set exist in the other7miniO(log n)? Fetch the least element greater than or equal to the given one8miniO(log n)< Fetch the least element strictly greater than the given one9miniO(log n)? Fetch the greatest element less than or equal to the given one:miniO(log n)< Fetch the greatest element strictly less than the given one;miniO(log n) Fetch the maximum element, or § if the set is empty<miniO(log n) Fetch the minimum element, or § if the set is empty=miniO(log n)% Check whether an element is in a set>miniO(1) Check whether a set is empty?miniO(n) Get the size of a set@miniO(n)> Check whether a set is internally height-balanced and ordered¬mini Empty nodeminiLeft-heavy nodemini Balanced nodeminiRight-heavy nodeminiSet*+,-./0123456789:;<=>?@*+,-./0123456789:;<=>?@ Safe-InferredΨέλGmini%A reference updating structures from s to t and fields from a to bHmini&Make a lens from a getter and a setterImini5Fetch the field referenced by a lens from a structureJminiΖUpdate the field referenced by a lens with an operation on a structureKminiΔOverwrite the field referenced by a lens with a value on a structureGHIJKGHIJK Safe-InferredήLmini,Instances should satisfy the following laws: lift . pure = pure &lift (m >>= f) = lift m >>= (lift . f)MminiΐLift a computation from the inner monad to the transformer monadLMLM Safe-InferredρNmini*A terminable transformer with termination e, inner monad m , return aPmini Unwrap an N computationQmini&Terminate the computation with a valueRmini$Run a computation and get its resultNOPQRNOPQR Safe-InferredφXmini*A terminable transformer with inner monad m , return aZmini Unwrap a X computation[mini)Terminate the computation without a value\mini$Run a computation and get its resultXYZ[\XYZ[\ Safe-InferredΥδ vbmini A parse erroreminiA transformer parsing symbols s, inner monad m , return agmini Unwrap a e0 computation with a sequence of symbols to parsehmini$Parse symbols satisfying a predicateiminiParse any symboljminiParse a symbolkminiParse a sequence of symbolslmini&Parse symbols included in a collectionmmini(Parse symbols excluded from a collectionnmini'Parse successfully only at end of inputomini*Parse the next symbol without consuming itpminiParse zero or more p separated by q via  p `sepBy` qqminiParse one or more p separated by q via  p `sepBy1` qrminiParse zero or more p until q succeeds via  p `till` qsminiParse one or more p left-associatively chained by f via  chainl1 p ftminiParse one or more p right-associatively chained by f via  chainr1 p fuminiParse p enclosed by a and b via  between a b pvminiParse p returning a in case of failure via  option a pwminiParse p, without consuming input, iff p fails via reject pxminiParse p, without consuming input, iff p succeeds via accept pymini%Find and parse the first instance of p via  findFirst pzmini$Find and parse the last instance of p via  findLast p}miniCombine the results of p and q via p <> q€miniParse p or, if p fails, backtrack and parse q via p <|> qefgbcdhijklmnopqrstuvwxyzefbcdghijklmnopqrstuvwxyz Safe-Inferred!Ξ„miniA transformer with read-only r, inner monad m , return a†mini Unwrap a „, computation with an initial read-only value‡miniFetch the read-only environmentˆmini+Run a computation in a modified environment„…†‡ˆ„…†‡ˆ  Safe-InferredΥ#'Ž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Υ$'™mini'A transformer with monoidal write-only w, inner monad m , return a›mini Unwrap a ™ computationœmini,Append a value to the write-only environment™š›œ™š›œ­   !"#$%&'()*+,-./0123456 7#$%&'()*+-89:;<=>?@ABCDEEFGHIJKLMNNOPHQRSTUVVWXXYZ[\]^_`abcdefghijklmnopqrstuvvwxyz{|}~   €  ‚ ƒ „ … † ‡ ˆ ‰ ‰ Š ‹ Œ  Ž  ‘’“”•–—˜‘’“”B™"mini-1.4.2.0-7qVBLib9SXMlTrjYu6fAa Mini.Data.Map Mini.Data.SetMini.Optics.LensMini.Transformers.ClassMini.Transformers.EitherTMini.Transformers.MaybeTMini.Transformers.ParserTMini.Transformers.ReaderTMini.Transformers.StateTMini.Transformers.WriterTminiMapemptyfromList fromListWithfromListWithKey singleton difference intersectionunion toAscList toDescList foldlWithKey foldrWithKeyadjustdeletefilter filterWithKeyinsert insertWith insertWithKeyupdate isSubmapOflookuplookupGElookupGTlookupLElookupLT 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 findFirstfindLast$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