h&9jw      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           "(c) Ross Paterson, Ralf Hinze 2006 BSD-stylerobdockins AT fastmail DOT fminternal (non-stable)0non-portable (MPTCs and functional dependencies) Safe-Inferred /O  EdisonCoreFinger trees with element type a", annotated with measures of type v). The operations enforce the constraint  v a.  EdisonCoreO(1). The empty sequence.  EdisonCoreO(1). A singleton sequence. EdisonCoreO(n)3. Create a sequence from a finite list of elements. EdisonCoreO(1)/. Add an element to the left end of a sequence. EdisonCoreO(1)0. Add an element to the right end of a sequence. EdisonCoreO(1). Is this the empty sequence? EdisonCoreO(1)%. Analyse the left end of a sequence. EdisonCoreO(1)&. Analyse the right end of a sequence. EdisonCoreO(log(min(n1,n2))). Concatenate two sequences. EdisonCoreO(log(min(i,n-i))). Split a sequence at a point where the predicate on the accumulated measure changes from  to . EdisonCoreO(n). The reverse of a sequence.    55&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fminternal (unstable)GHC, Hugs (MPTC and FD) Safe-Inferred 0m()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred 2+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred 4+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred 6&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fminternal (unstable)GHC / Hugs (MPTC and FD) Safe-Inferred 8--+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred 9'Copyright (c) 2006, 2008 Robert Dockins0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred ; &Copyright (c) 1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred =|99 +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred ?599 &Copyright (c) 1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred @;; +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred B99 +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred Dc99(c) David F. Place 2006BSDrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred O EdisonCoreA set of values a implemented as bitwise operations. Useful for members of class Enum with no more elements than there are bits in Word. EdisonCoreO(1). Is this the empty set? EdisonCoreO(1)$. The number of elements in the set. EdisonCoreO(1). Is the element in the set? EdisonCoreO(1). The empty set. EdisonCoreO(1). Create a singleton set. EdisonCoreO(1). Insert an element in a set. If the set already contains an element equal to the given value, it is replaced with the new value. EdisonCoreO(1). Delete an element from a set. EdisonCoreO(1)8. Is this a proper subset? (ie. a subset but not equal). EdisonCoreO(1). Is this a subset? (s1  s2) tells whether s1 is a subset of s2. EdisonCoreO(1). The minimal element of a set. EdisonCoreO(1). The maximal element of a set. EdisonCoreO(1). Delete the minimal element. EdisonCoreO(1). Delete the maximal element. EdisonCoreThe union of a list of sets: (unions ==   ). EdisonCoreO(1). The union of two sets. EdisonCoreO(1). Difference of two sets. EdisonCoreO(1). The intersection of two sets. EdisonCoreO(1)1. The complement of a set with its universe set.  complement can be used with bounded types for which the universe set will be automatically created. EdisonCoreO(n)1. Filter all elements that satisfy the predicate. EdisonCoreO(n). Partition the set into two sets, one with all elements that satisfy the predicate and one with all elements that don't satisfy the predicate. See also split. EdisonCoreO(n).  f s! is the set obtained by applying f to each element of s.It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y EdisonCoreO(1) Changes the type of the elements in the set without changing the representation. Equivalant to map (toEnum . fromEnum) , and to (fromBits . toBits)(. This method is operationally a no-op. EdisonCoreO(1) Get the underlying bit-encoded representation. This method is operationally a no-op. EdisonCoreO(1) Create an EnumSet from a bit-encoded representation. This method is operationally a no-op.&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fminternal (unstable)GHC, Hugs (MPTC and FD) Safe-Inferred Q66'Copyright (c) 2002, 2008 Andrew Bromage0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred SE     'Copyright (c) 2006, 2008 Robert Dockins0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred U &Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred X2 &Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred Z 'Copyright (c) 2006, 2008 Robert Dockins0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred ] +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred _ +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred a       +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred c+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred e+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred g.+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD) Safe-Inferred i5 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&')*.,-+3( #$!"&').,+!"#$*-3( &')*.,-+3( #$!"ik&'+#$&'+#$    & '     +                                         # $                     & '     +                                     # $                           & '         +                                          # $                & '     +                                     # $                         & '      +                                    # $                     +&'#$k&'+#$&'+#$&'+#$&'+#$+&')*.( 3#$,-!"&')*.,-+3 #$(!"&'),-+#$*.3( !"&'),+!"#$*.-3( &')*.,-+3( !"#$&')*.,-+3( #$!"&')*.,-+3( !"#$'EdisonCore-1.3.3-BNxc4kacy1MIpafWuA6ddbData.Edison.Concrete.FingerTreeData.Edison.Seq.DefaultsData.Edison.Seq.BraunSeqData.Edison.Seq.BinaryRandListData.Edison.Seq.BankersQueueData.Edison.Coll.DefaultsData.Edison.Coll.UnbalancedSetData.Edison.Coll.StandardSetData.Edison.Coll.SplayHeapData.Edison.Coll.SkewHeapData.Edison.Coll.MinHeapData.Edison.Coll.LeftistHeap Data.Edison.Coll.LazyPairingHeapData.Edison.Coll.EnumSetData.Edison.Assoc.DefaultsData.Edison.Assoc.TernaryTrieData.Edison.Assoc.StandardMapData.Edison.Assoc.PatriciaLoMapData.Edison.Assoc.AssocListData.Edison.Seq.FingerSeqData.Edison.Seq.JoinListData.Edison.Seq.MyersStackData.Edison.Seq.RandListData.Edison.Seq.RevSeqData.Edison.Seq.SimpleQueueData.Edison.Seq.SizedSeqSplit FingerTreestructuralInvariantsizefoldFTtoListreduce1reduce1'strict strictWithmapTreeempty singletonfromListlconsrconsnulllviewrviewappendsplit takeUntil dropUntil splitTreereverse$fCoArbitraryDigit$fArbitraryDigit$fMeasuredvDigit$fCoArbitraryNode$fArbitraryNode$fMeasuredvNode$fCoArbitraryFingerTree$fArbitraryFingerTree$fShowFingerTree$fOrdFingerTree$fEqFingerTree$fMeasuredvFingerTree $fShowNode $fShowDigitrconsUsingAppendrconsUsingFoldrappendUsingFoldr rviewDefaultrtailUsingLviewrtailMUsingLviewconcatUsingFoldrreverseUsingReverseOntoreverseUsingListsreverseOntoUsingFoldlreverseOntoUsingReversefromListUsingConstoListUsingFoldr mapUsingFoldrconcatMapUsingFoldrfoldrUsingListsfoldr'UsingListsfoldlUsingListsfoldl'UsingListsfoldr1UsingListsfoldr1'UsingListsfoldl1UsingListsfoldl1'UsingListsfold1UsingFoldfold1'UsingFold'foldr1UsingLviewfoldr1'UsingLviewfoldl1UsingFoldlfoldl1'UsingFoldl'reducerUsingReduce1reducer'UsingReduce1'reducelUsingReduce1reducel'UsingReduce1'reduce1UsingListsreduce1'UsingListscopyUsingListsinBoundsUsingDropinBoundsUsingLookupMinBoundsUsingSizelookupUsingLookupMlookupUsingDroplookupWithDefaultUsingLookupMlookupWithDefaultUsingDroplookupMUsingDropfilterUsingLviewfilterUsingListsfilterUsingFoldrpartitionUsingListspartitionUsingFoldrupdateUsingAdjustupdateUsingSplitAtadjustUsingListsadjustUsingSplitAtmapWithIndexUsingListsfoldrWithIndexUsingListsfoldrWithIndex'UsingListsfoldlWithIndexUsingListsfoldlWithIndex'UsingListstakeUsingListstakeUsingLviewdropUsingListsdropUsingLtailsplitAtDefaultsplitAtUsingLview subseqDefaulttakeWhileUsingLviewdropWhileUsingLviewsplitWhileUsingLview zipUsingLviewzip3UsingLviewzipWithUsingLviewzipWith3UsingLview zipUsingListszip3UsingListszipWithUsingListszipWith3UsingListsunzipUsingListsunzipUsingFoldrunzip3UsingListsunzip3UsingFoldrunzipWithUsingListsunzipWithUsingFoldrunzipWith3UsingListsunzipWith3UsingFoldrshowsPrecUsingToListreadsPrecUsingFromListdefaultCompare dropMatch tokenMatch readSParens maybeParensSeq moduleNamelheadlheadMltailltailMrheadrheadMrtailrtailMmapcopyinBoundslookuplookupMlookupWithDefaultupdateadjust mapWithIndextakedropzipzip3zipWithzipWith3unzipunzip3 unzipWith unzipWith3concat reverseOnto concatMapfoldfold'fold1fold1'foldrfoldr'foldlfoldl'foldr1foldr1'foldl1foldl1'reducerreducer'reducelreducel'foldrWithIndexfoldrWithIndex'foldlWithIndexfoldlWithIndex'splitAtsubseqfilter partition takeWhile dropWhile splitWhile $fMonoidSeq$fSemigroupSeq$fCoArbitrarySeq$fArbitrarySeq $fReadSeq $fShowSeq$fOrdSeq$fMonadPlusSeq $fMonadSeq$fApplicativeSeq$fAlternativeSeq $fFunctorSeq $fSequenceSeq$fEqSeqinsertSeqUsingUnioninsertSeqUsingFoldrmemberUsingFoldcountUsingMemberlookupAllUsingLookupMdeleteSeqUsingDeleteunionSeqUsingFoldlunionSeqUsingFoldl'unionSeqUsingReducefromSeqUsingFoldrfromSeqUsingUnionSeqtoSeqUsingFold unsafeInsertMaxUsingUnsafeAppendtoOrdSeqUsingFoldr$unsafeFromOrdSeqUsingUnsafeInsertMindisjointUsingToOrdListintersectWitnessUsingToOrdListlookupUsingLookupAlllookupMUsingLookupAlllookupWithDefaultUsingLookupAlldeleteMaxUsingMaxViewfromSeqWithUsingInsertWithinsertUsingInsertWithunionUsingUnionWithfilterUsingOrdListspartitionUsingOrdLists!intersectionUsingIntersectionWithdifferenceUsingOrdLists"symmetricDifferenceUsingDifferenceproperSubsetUsingOrdListssubsetUsingOrdListsproperSubsetOnOrdListssubsetOnOrdListsinsertSeqWithUsingInsertWithunionlUsingUnionWithunionrUsingUnionWithunionWithUsingOrdListsunionSeqWithUsingReducerintersectionWithUsingOrdListsunsafeMapMonotonicUsingFoldrcompareUsingToOrdListSet insertWithdeletemember deleteMin deleteMaxunsafeInsertMinunsafeInsertMaxunsafeFromOrdSeq unsafeAppendfilterLTfilterLEfilterGTfilterGEpartitionLT_GEpartitionLE_GTpartitionLT_GTminViewminElemmaxViewmaxElemunsafeMapMonotonicfromSeqinsert insertSequnionunionSeq deleteAll deleteSeqcounttoSeq lookupAlltoOrdSeq intersection differencesymmetricDifference properSubsetsubset fromSeqWith insertSeqWithunionlunionr unionWith unionSeqWithintersectionWith$fOrdSet $fMonoidSet$fSemigroupSet$fCoArbitrarySet$fArbitrarySet $fReadSet $fShowSet$fEqSet $fOrdSetSeta $fOrdSetXSeta $fSetSeta $fSetXSeta $fOrdCollSeta $fCollSeta$fOrdCollXSeta $fCollXSetaHeap $fOrdHeap $fMonoidHeap$fSemigroupHeap$fCoArbitraryHeap$fArbitraryHeap $fReadHeap $fShowHeap$fEqHeap$fOrdCollHeapa $fCollHeapa$fOrdCollXHeapa $fCollXHeapaMinfromColltoColl$fOrdMin $fMonoidMin$fSemigroupMin$fCoArbitraryMin$fArbitraryMin $fReadMin $fShowMin $fOrdCollMina $fCollMina$fOrdCollXMina $fCollXMina$fEqMin complement setCoercetoBitsfromBits fromOrdSeqsingletonUsingInsertfromSeqUsingInsertSeqdeleteSeqUsingFoldrmemberUsingLookupMpartitionUsingFilterfold1UsingElementselementsUsingFoldnullUsingElementsinsertWithUsingLookupMfromSeqWithUsingInsertSeqWith#fromSeqWithKeyUsingInsertSeqWithKeyinsertWithKeyUsingInsertWith"insertSeqWithKeyUsingInsertWithKeyunionSeqWithUsingReduceunionSeqWithUsingFoldrtoSeqUsingFoldWithKeykeysUsingFoldWithKeyunionWithUsingInsertWithunionWithKeyUsingInsertWithKeyunionSeqWithKeyUsingReduceunionSeqWithKeyUsingFoldrintersectionWithUsingLookupMintersectionWithKeyUsingLookupMdifferenceUsingDeleteproperSubsetUsingSubsetsubsetUsingMembersubmapByUsingLookupMproperSubmapByUsingSubmapBysameMapByUsingOrdListssameMapByUsingSubmapBylookupAndDeleteDefaultlookupAndDeleteMDefaultlookupAndDeleteAllDefaultadjustOrInsertUsingMemberadjustOrDeleteDefaultadjustOrDeleteAllDefaultminElemUsingMinViewdeleteMinUsingMinView!minElemWithKeyUsingMinViewWithKeymaxElemUsingMaxView!maxElemWithKeyUsingMaxViewWithKeytoOrdSeqUsingFoldrWithKeyshowsPrecUsingToOrdListreadsPrecUsingUnsafeFromOrdSeqFMmergeVFM mergeKVFMlookupAndDeletelookupAndDeleteMlookupAndDeleteAll adjustAlladjustOrInsertadjustAllOrInsertadjustOrDeleteadjustOrDeleteAll foldrWithKey foldlWithKey foldrWithKey' foldlWithKey'elementsfromSeqWithKey insertWithKeyinsertSeqWithKeysubmapByproperSubmapBy sameMapBy properSubmapsubmapsameMapkeys mapWithKey foldWithKey foldWithKey' filterWithKeypartitionWithKey unionWithKeyunionSeqWithKeyintersectionWithKeyminViewWithKeyminElemWithKeymaxViewWithKeymaxElemWithKey $fMonoidFM $fSemigroupFM$fCoArbitraryFM $fArbitraryFM$fOrdFM$fEqFM$fReadFM$fShowFM $fFunctorFM$fOrdFiniteMapFM[]$fOrdFiniteMapXFM[]$fOrdAssocFM[]$fOrdAssocXFM[]$fFiniteMapFM[]$fFiniteMapXFM[] $fAssocFM[] $fAssocXFM[]$fOrdFiniteMapMapk$fFiniteMapMapk$fOrdAssocMapk $fAssocMapk$fOrdFiniteMapXMapk$fFiniteMapXMapk$fOrdAssocXMapk $fAssocXMapk$fOrdFiniteMapFMInt$fOrdFiniteMapXFMInt$fOrdAssocFMInt$fOrdAssocXFMInt$fFiniteMapFMInt$fFiniteMapXFMInt $fAssocFMInt $fAssocXFMInt$fOrdFiniteMapFMk$fFiniteMapFMk $fOrdAssocFMk $fAssocFMk$fOrdFiniteMapXFMk$fFiniteMapXFMk$fOrdAssocXFMk $fAssocXFMk $fMonoidSizeM$fSemigroupSizeM$fCoArbitraryElem$fArbitraryElem$fMeasuredSizeMElem $fEqSizeM $fOrdSizeM $fNumSizeM $fEnumSizeM $fShowSizeM$fEqTreeRev instanceName $fMonoidRev$fSemigroupRev$fCoArbitraryRev$fArbitraryRev $fReadRev $fShowRev$fOrdRev$fEqRev$fMonadPlusRev $fMonadRev$fApplicativeRev$fAlternativeRev $fFunctorRev $fSequenceRevSized $fMonoidSized$fSemigroupSized$fCoArbitrarySized$fArbitrarySized $fReadSized $fShowSized $fOrdSized $fEqSized$fMonadPlusSized $fMonadSized$fApplicativeSized$fAlternativeSized$fFunctorSized$fSequenceSized&EdisonAPI-1.3.3-AivavHOOMDj4gVPk6UeCUBData.Edison.PreludeMeasuredghc-prim GHC.TypesFalseTruercons0