h$      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~None- #%&'(-./0235678;>?pvectorUsed to support older ghcs.   None) #%&'(-./0235678;>?C !"#$%&'()* !"#$%&'()*None) #%&'(-./0235678;>?5+pvectorCoercive left-composition.(All #. not) TrueAll {getAll = False}*The semantics with respect to bottoms are: p + E D E p + f D p  f ,pvectorCoercive right-composition.(stimes 2 .# Product) 3Product {getProduct = 9}*The semantics with respect to bottoms are: E , p D E f , p D p  f +,+,+9 ,9 None. #%&'(-./0235678;>?,#2pvector A vector.$The instances are based on those of Seq-s, which are in turn based on those of lists.3pvectorInvariants: The only time tail can be empty is when init is empty. Otherwise tailOffset will give the wrong value.5pvector1 << 5+ is the maximum that each child can contain8pvectorO(1)=. A bidirectional pattern synonym matching an empty sequence.9pvector O(\log n). A bidirectional pattern synonym viewing the rear of a non-empty sequence.:pvectorO(n) Lazy right fold.;pvectorO(n) Strict right fold.<pvectorO(n) Lazy left fold.=pvectorO(n) Strict left fold.>pvectorO(n) Indexed lazy right fold.?pvectorO(n) Indexed lazy left fold.@pvectorO(n) Indexed strict right fold.ApvectorO(n) Indexed strict left fold.FpvectorO(1)!. A vector with a single element.GpvectorO(1). The empty vector.HpvectorO(1) Return  if the vector is empty,  otherwise.Ipvector O(\log n). An alias for J Mnemonic: a triangle with the single element at the pointy end.Jpvector O(\log n)) Add an element to the end of the vector.Rpvector O(\log n). The element at the index or  if the index is out of range.Spvector O(\log n)". The element at the index. Calls  if the index is out of range.Tpvector O(\log n). A flipped version of S.Upvector O(\log n). A flipped version of R.Vpvector O(\log n). Adjust the element at the index by applying the function to it. If the index is out of range, the original vector is returned.Xpvector O(\log n) . Same as V but can have effects through Ypvector O(\log n). Replace the element at the specified position. If the position is out of range, the original sequence is returned.Zpvector O(\log n)*. Decompose a list into its head and tail.If the list is empty, returns ."If the list is non-empty, returns  (x, xs) , where x is the head of the list and xs its tail.\pvectorThe index of the first element of the tail of the vector (that is, the *last* element of the list representing the tail). This is also the number of elements stored in the array tree.Caution: Only gives a sensible result if the vector is nonempty.]pvectorO(1) Get the length of the vector.apvector Convert a  to a listbpvectorO(n)/. Apply a function to all values in the vector.cpvectorO(n);. Apply a function to all values of a vector and its index.fpvectorO(n). For each pair (i,a) from the vector of index/value pairs, replace the vector element at position i by a. 0update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>gpvectorO(n). Concatenate two vectors.hpvector!Check the invariant of the vectoripvectorO(n). Create a vector from a list.Lpvector&The Vector to perform the operation onpvectorThe the added size. We can't find this from the array because the array might have bogus size due to undefined elementspvector The array to add as the new tail-/.1023456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst234567-/.10:;<=>?@ABCDEFGHI98JKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrst95m8n8None) #%&'(-./0235678;>?'298:;<=FGHIJRSTUVXYZ]`bdfgi:;<=29898IG]RSUTYVXJFHfgbd`iZNone* #%&'(-./0235678;>?OPOP      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL*MNOPQRSTUVWXYZ[\]^_`+abcdefghijklmnopqrstuvwxyz{|}~%pvector-0.1.0.0-iwvE2ojTzF4QV7czpzvqs%Data.Vector.Persistent.Internal.Array&Data.Vector.Persistent.Internal.Buffer.Data.Vector.Persistent.Internal.CoercibleUtilsData.Vector.Persistent.InternalData.Vector.PersistentData.Vector.Persistent.UnsafeMArrayArrayshrinkSmallMutableArray_mapSmallArray#nullSmallArraylastSmallArraysingletonSmallArray twoSmallArrayupdateSmallArraymodifySmallArraymodifySmallArrayFmodifySmallArray'modifySmallArray#updateResizeSmallArray popSmallArray undefinedElemifoldrStepSmallArrayifoldlStepSmallArrayifoldrStepSmallArray'ifoldlStepSmallArray'imapStepSmallArrayimapStepSmallArray'itraverseStepSmallArrayBuffer$sel:offset:Buffer$sel:marr:BuffernewnewWithCapacitypushreadwriteclearshrink unsafeShrinkcapacitynulllengthresizegrowfreeze unsafeFreeze#..#Node InternalNodeDataNode!$sel:getInternalNode:InternalNode$sel:getDataNode:InternalNodeVectorRootNode$sel:size:RootNode$sel:shift:RootNode$sel:init:RootNode$sel:tail:RootNodeEmpty:|>foldrfoldr'foldlfoldl'ifoldrifoldlifoldr'ifoldl'persistentVectorEqnodeEqpersistentVectorCompare nodeCompare singletonempty|>snoc unsafeSnocsnocArrsnocTailnewPath unsafeIndex unsafeIndex#lookup#lookupindex!!?adjustadjust#adjustFupdateunsnoc unsnocTail# tailOffsetimpossibleError moduleErrortoListpureStreamToListmapimaptraverse itraverse//>< invariantfromListkeyBits nodeWidthkeyMask!<<.!>>.unstreamstreamToContentsstreamLstreamRistreamListreamR $fOrdNode$fEqNode$fIsListVector$fNFData1Vector$fMonadPlusVector$fAlternativeVector$fMonadFailVector $fMonadVector$fApplicativeVector$fNFDataVector$fMonoidVector$fSemigroupVector$fTraversableVector$fFoldableVector$fFunctorVector $fOrdVector $fEqVector $fShowVector $fShow1Vector $fShowNodebaseGHC.Base.ghc-prim GHC.TypesTrueFalse GHC.MaybeNothingGHC.Errerror ApplicativeJust,vector-stream-0.1.0.0-6UufFtoaTP73gTDZeHsWfxData.Stream.MonadicStream