úÎ\ßRˆÂ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķ·ļđšŧž―ūŋĀÁSafeÂÂÂÂ1None234=  !"#$%&'()*+,-./0123456789:;<9  !"#$%&'()*+,-./012345678=  <;:9 !"#$%&'()*+,-./0123456784   !"#$%&'()*+,-./0123456789:;<NoneÃÃNoneM O(n*log n)). The sequence of suffixes of a sequence.NA generalization of MS where the suffixes are passed to a monadic continuation, recording their results.O O(n*log n)3. The sequence of non-empty suffixes of a sequence.’The underlying tree structure is reused to represent the overall sequence, as well as every suffix, which might exacerbate worst case situations.\log(n)9. The element at the specified position, counting from 0.b$Helper function for checking bounds.yA hacky implementation of the Ä product.1IJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxy1IJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxy1IJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxy1IJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyNone*2349;2}EA type synonym for documentation. Marks functions that only use the Å method of random generators.~0A type synonym for documentation. Marks uses of Æ.+The sequence type with a default generator.‚  empty :: ~ (Seq a) O(1). The empty sequence.ƒ singleton :: a -> ~ (Seq a) O(1). A singleton sequence.„ fromList :: [a] -> ~ (Seq a) O(n)3. Create a sequence from a finite list of elements. The inverse Į is given by the Č instance of .… %fromFunction :: Int -> (Int -> a) -> ~; (Seq a) fromFunction n f = fromList (fmap f [0 .. n - 1]) O(n).†  (<|) :: a ->  a ->  a ‡ (|>) ::  a -> a ->  a ˆ (><) ::  a ->  a ->  a ‰O(1). The empty sequence.ŠO(1). A singleton sequence.Œ replicate :: Int -> a -> ~ (Seq a) O(n). 0replicateA :: Applicative f => Int -> f a -> f (~ (Seq a)) O(n).Ž *replicateM :: Monad m => Int -> m a -> m (~ (Seq a)) O(n). cycleTaking :: Int ->  a ->  a O(k). $iterateN :: Int -> (a -> a) -> a -> ~ (Seq a) O(n).‘ 'unfoldr :: (b -> Maybe (a, b)) -> b -> ~ (Seq a) O(n), where n& is the length of the output sequence.’ 'unfoldl :: (b -> Maybe (b, a)) -> b -> ~ (Seq a) O(n), where n& is the length of the output sequence.“ null ::  a -> Bool O(1). Is this the empty sequence?”  length ::  a -> Int O(1)). The number of elements in the sequence.–  tails :: }- g => Seq' g a -> Seq' g (Seq' g a) tails ::  a ->  ( a) — ,takeWhileL :: (a -> Bool) -> Seq a -> Seq a ˜ takeWhileR :: (a -> Bool) ->  a ->  a ™ dropWhileL :: (a -> Bool) ->  a ->  a š dropWhileR :: (a -> Bool) ->  a ->  a ›  spanl :: }f g => (a -> Bool) -> Seq' g a -> (Seq' g a, Seq' g a) spanl :: (a -> Bool) -> Seq a -> (Seq a, Seq a) œ  spanr :: }N g => (a -> Bool) -> Seq' g a -> (Seq' g a, Seq' g a) spanr :: (a -> Bool) ->  a -> ( a,  a)   breakl :: }O g => (a -> Bool) -> Seq' g a -> (Seq' g a, Seq' g a) breakl :: (a -> Bool) ->  a -> ( a,  a) ž  breakr :: }O g => (a -> Bool) -> Seq' g a -> (Seq' g a, Seq' g a) breakr :: (a -> Bool) ->  a -> ( a,  a) Ÿ  partition :: }R g => (a -> Bool) -> Seq' g a -> (Seq' g a, Seq' g a) partition :: (a -> Bool) ->  a -> ( a,  a)   filter :: (a -> Bool) ->  a ->  a Ą lookup :: Int ->  a -> Maybe a Ē (?!) ::  a -> Int -> Maybe a Ģ  index ::  a -> Int -> a Ī adjust :: (a -> a) -> Int ->  a ->  a Ĩ adjust' :: (a -> a) -> Int ->  a ->  a Ķ update :: Int -> a ->  a ->  a § take :: Int ->  a ->  a Ļ drop :: Int ->  a ->  a Đ insertAt :: Int -> a ->  a ->  a Š deleteAt :: Int ->  a ->  a Ŧ  splitAt :: }@ g => Int -> Seq' g a -> (Seq' g a, Seq' g a) splitAt :: Int ->  a -> ( a,  a) Ž #mapWithIndex :: (Int -> a -> b) ->  a ->  b ­ ;traverseWithIndex :: Applicative f => (Int -> a -> f b) ->  a ->  b Ū zip ::  a ->  b ->  (a, b) Ŋ zipWith :: (a -> b -> c) ->  a ->  b ->  c ąPut a fresh generator.ēWrap a  into a .ŧ  pure :: a -> ~ ( a) (<*>) ::  (a -> b) ->  a ->  b Ez{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķ·ļđšŧž―ūAz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķ·ļđšE€ū―žŧ~}‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”z{|•–—˜™š›œžŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķ·ļđšBz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķ·ļđšŧž―ūNoneÉStdGen is not an instance of Ęa, and random generators should be pretty strict for efficiency anyway, so we don't require and Ę for them.ÉÉNoneAz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķ·ļđšNone9  !"#$%&'()*+,-./012345678Ë      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆˆ7‰Š‹ŒŽ8T‘’“”•–—UXYZ[˜™š›`cdœfghiklmnoz|~žŸ ĄĒĢĪĨĶ§ĻĐŠŦŽ­ŪŊ°ąēģīĩķą·ļąđšąđŧž―ūŋĀ"raz-0.1.0.0-LRfdeD5RC4q336qVZIaDDlData.Raz.Core.InternalData.Raz.Core.SequenceData.Raz.Sequence.Internal Data.Raz.UtilData.Raz.Core.InstancesData.Raz.Sequence.InstancesData.Raz.Sequence Data.Raz.CoreRazTListNilConsLevelTreeEmptyLeafBinDirLRCntLev randomLevel singletonemptysizetrimtrim'viewCviewview'alterCadjustCadjustC'alteralter'insertremoveremove'removeCmovemove'focusfocus'focusLfocusL'focusRfocusR' joinSides headAsTreetailgrowgrow'unfocusfromList fromList'pushfoldbin insertAt'showRaz treeToList halfToListshowTree $fReadTree $fShowTree $fOrdTree$fEqTree$fEqDir$fOrdDir $fShowDir $fReadDir $fFunctorTree$fFoldableTree$fTraversableTree $fEqTList $fOrdTList$fFunctorTList$fFoldableTList$fTraversableTListconssnocappend replicatetails tailsWith tailsWith' takeWhileL takeWhileR dropWhileL dropWhileRspanLspanRbreakLbreakR partition partition' partition''filterlookup!?indexadjustadjust'updatecheckedtakedropinsertAtdeleteAtsplitAt elemIndexL elemIndicesL elemIndexR elemIndicesR findIndexL findIndicesL findIndicesL' findIndexR findIndicesR findIndicesR' mapWithIndex mapWithIndex'traverseWithIndextraverseWithIndex'zipzipWithzipWith'apViewL'EmptyL:< SplittableImpureSeqSeq' fromFunction<||>><empty' singleton' replicateA replicateM cycleTakingiterateNunfoldrunfoldlnulllengthviewlspanlspanrbreaklbreakr?!splitSeq refreshSeq createSeqseqBindseqDnibseqRunseqLiftseqLift2 seqLiftSplitseqApplyseqLens$fApplicativeSeq' $fShowSeq' $fOrdSeq'$fEqSeq' $fFunctorSeq'$fFoldableSeq'$fTraversableSeq'<&> $fNFDataTreebaseGHC.Base Applicative!random-1.1-54KmMHXjttlERYcr1mvsAe System.Randomsplit GHC.IO.UnsafeunsafePerformIO Data.FoldabletoListFoldable $fNFDataSeq'deepseq-1.4.2.0Control.DeepSeqNFData