s      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~             ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                                                                                                                                   ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | } ~                                                             !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~"(c) Ross Paterson, Ralf Hinze 2006 BSD-stylerobdockins AT fastmail DOT fminternal (non-stable)0non-portable (MPTCs and functional dependencies)None 9:;<=?BIT Finger trees with element type a", annotated with measures of type v). The operations enforce the constraint  v a. O(1). The empty sequence. O(1). A singleton sequence.O(n)3. Create a sequence from a finite list of elements.O(1)/. Add an element to the left end of a sequence.O(1)0. Add an element to the right end of a sequence.O(1). Is this the empty sequence?O(1)%. Analyse the left end of a sequence.O(1)&. Analyse the right end of a sequence.O(log(min(n1,n2))). Concatenate two sequences.O(log(min(i,n-i)))[. Split a sequence at a point where the predicate on the accumulated measure changes from  to .O(n). The reverse of a sequence.^   !"#$%    T   !"#$%55&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fminternal (unstable)GHC, Hugs (MPTC and FD)None 9:;<=?BIT[()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~[()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~[()*+,-./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)None 9:;<=?BIT`LL]&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fminternal (unstable)GHC / Hugs (MPTC and FD)None 9:;<=?BIT----+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITI      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL9      !"#$%&'()*+,-./0123456789:;<=>?@A9   9:;7 ">?)@#$%&'(8=< !*+,-./012345A6 F      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKL+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITGMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~9MNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~9MPQ}R~STUVWXY{OZ[\]^_`ab|cdefghijklmnopqrstuvwxyzNEMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITF99D&Copyright (c) 1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITF     9     9     D      'Copyright (c) 2006, 2008 Robert Dockins0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITN !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefF !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^F !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHILMJKNOP^QRSTUVWXYZ[\]N !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdef (c) David F. Place 2006BSDrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITgA set of values au implemented as bitwise operations. Useful for members of class Enum with no more elements than there are bits in Word.iO(1). Is this the empty set?jO(1)$. The number of elements in the set.kO(1). Is the element in the set?qO(1). The empty set.rO(1). Create a singleton set.sO(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.uO(1). Delete an element from a set.xO(1)8. Is this a proper subset? (ie. a subset but not equal).yO(1). Is this a subset? (s1 y s2) tells whether s1 is a subset of s2.zO(1). The minimal element of a set.{O(1). The maximal element of a set.|O(1). Delete the minimal element.}O(1). Delete the maximal element.The union of a list of sets: (unions ==   q).O(1). The union of two sets.O(1). Difference of two sets.O(1). The intersection of two sets.O(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.O(n)1. Filter all elements that satisfy the predicate.O(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.O(n).  f s! is the set obtained by applying f to each element of s.KIt's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f yO(1)d 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.O(1)X Get the underlying bit-encoded representation. This method is operationally a no-op.O(1)^ Create an EnumSet from a bit-encoded representation. This method is operationally a no-op.kghijklmnopqrstuvwxyz{|}~Kghijklmnopqrstuvwxyz{|}~Kgqrsuvwijkl|}xymnop~z{thjghijklmnopqrstuvwxyz{|}~ +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITW     FFU      &Copyright (c) 1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITI !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ; !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOP; !"#$%&'(O)*+,-./0123P456789:;<=>?@ABCDEFGHIJKLMNG !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT_\]^_`abcdefghijklmnopqrst   uvwxyz{|}~L\]^_`abcdefghijklmnopqrstuvwxyz{|}~L\_`abcdegijlfhkmnopqrstuvwxyz{|}~^]^\]^_`abcdefghijklmnopqrst   uvwxyz{|}~+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT]         LL[         'Copyright (c) 2006, 2008 Robert Dockins0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITg       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN O PQRSTUVWXYZ[\]^_`abcdefghJ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWJ#$%& !"DE/F'()*+,;<9:=>?@AB-.C780123MNO456GHIJKLPQRSTUVWd         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMN O PQRSTUVWXYZ[\]^_`abcdefgh+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT]n   o pqrstuvwxyz{|}~  Jnopqrstuvwxyz{|}~Jnpqrstuvxz{}wy|~oZn   o pqrstuvwxyz{|}~  +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT\        L     L     Z        +Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT`   ! " # !"#$%&'()*+,-./0123456789:;<=>?@ $A %BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuL !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghiL !"BC$%'D)E&(*F+,GH-IJ.K/0123456LMNOPQRS78#9:;<=>TUVWXY?Z][\^_`abcdefgh@Ai\    ! " # !"#$%&'()*+,-./0123456789:;<=>?@ $A %BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstu+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT]x &yz{|}~Oxyz{|}~Ox}~yz{|\x &yz{|}~+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT_ ' ( ) * + ,      !"#$%&'()*+,L     L     ^ ' ( ) * + ,      !"#$%&'()*+,+Copyright (c) 1998-1999, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT]- -./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~O-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{O-2345678:<=?9;>@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdfeghijklmnopqrstuvwxyz{./01\- -./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fminternal (unstable)GHC, Hugs (MPTC and FD)None 9:;<=?BIT6666&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B      !"#$%&'()*+,-./0123456h      !"#$%&h      !"#$%& . / 0 1 2 3 4 5 6 7 8 9 : ; < = > ? @ A B      !"#$%&'()*+,-./0123456&Copyright (c) 1998, 2008 Chris Okasaki0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT7 C D E89 F G H I J K L M N O P Q:;<=>?@ABCD REFGHIJ S TKLMNOPQRSTUVWXY UZ[\]^_`abcdefghi V Wjklmnopqrstuvwxyz{|}~f789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~f7:;<=>?@ABCDEFGhiHIJKLMNOPQ9abcdeRSTUVWXYZ[\]^_`fgjnpqlrsuvwxyz{|}komt~87 C D E89 F G H I J K L M N O P Q:;<=>?@ABCD REFGHIJ S TKLMNOPQRSTUVWXY UZ[\]^_`abcdefghi V Wjklmnopqrstuvwxyz{|}~'Copyright (c) 2006, 2008 Robert Dockins0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BITp     h     h     p     'Copyright (c) 2002, 2008 Andrew Bromage0MIT; see COPYRIGHT file for terms and conditionsrobdockins AT fastmail DOT fmstableGHC, Hugs (MPTC and FD)None 9:;<=?BIT X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH x yIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno zp {q |r }stu ~v w x yz{|} ~   j !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~j!"#$%&'()*+,-./0123456789:;PQ<=>IJMNOfghijklRSTUVWXYZ[\]^_a`bcdemnoprtuvxz{?EGKDFHL|}~qswy@BAC  X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n o p q r s t u v w !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGH x yIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmno zp {q |r }stu ~v w x yz{|} ~     !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~&').,+!"#$*-3( ik     &'+ !"#$%&'#$()*+,-./012345678&'+!", #$%&'#$()*+-./012345678&'+!", #$%&'#$()*+-./012345678&'+!", #$%&-'#$()*+./012345678 9  & ' (  )  *    +    # ! " $  ,   +         # $ % & - : ; < = > ? @ A B C D E F ' G H I J K L M N 9 +    " & '  @    = > $ &  , # %    +        *  B C D E ; < : F O ' P Q R ( S ) A ! - ? # $ T U V W X Y G H I K L J M N Z 9  & ' @  +    ,   +         # $ % & ' # $ (  )  *    ! " - : ; < = > ? A B C D E F T U V W X Y Z G H I J K L M N [  \ ] & ' (  )  *    +    ! "  ,   +         # $ % & - ' # $ ^ _ ` a b c d e f g h   & ' ) * . , - +  3 ( # $ ! " &')*.,-+3( #$!"+&')*.( 3#$,-!"ijklmnopq&')*.,-+3 #$(!"&'),-+#$*.3( !"&'),+!"#$*.-3( rst(!&')*.,-+3( !"#$uvwxyz{|}~&')*.,-+3( #$!"t(!&')*.,-+3( !"#$k &')(*+"!BC#$%&,+ -#$@ADE?F;=>&'(+?@BCDF;=>#$#%$&,+ -)*"AE!&'()*+"#$#$%&,+ ?@ABCDEF;=>!-&'()*+"#$?@ABCDEF;=>!#$%&,+ -       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPIQRSTIUVIWIW 9 X Y  Z [ \ ] ^ _ ` a b c d e f g I W I h i j k l m n o pIqLrsttuuvwxyzIU{LI|}I|~UWLklmnopIIUq[WUI)EdisonCore-1.3.1.1-14FKBfIx4CQHL5lx2F3b2vData.Edison.Concrete.FingerTreeData.Edison.Seq.DefaultsData.Edison.Seq.BinaryRandListData.Edison.Coll.Defaults Data.Edison.Coll.LazyPairingHeapData.Edison.Coll.LeftistHeapData.Edison.Coll.SkewHeapData.Edison.Coll.SplayHeapData.Edison.Coll.StandardSetData.Edison.Coll.EnumSetData.Edison.Coll.UnbalancedSetData.Edison.Coll.MinHeapData.Edison.Seq.BankersQueueData.Edison.Seq.BraunSeqData.Edison.Seq.FingerSeqData.Edison.Seq.JoinListData.Edison.Seq.MyersStackData.Edison.Seq.RandListData.Edison.Seq.RevSeqData.Edison.Seq.SimpleQueueData.Edison.Seq.SizedSeqData.Edison.Assoc.DefaultsData.Edison.Assoc.AssocListData.Edison.Assoc.PatriciaLoMapData.Edison.Assoc.StandardMapData.Edison.Assoc.TernaryTrieSplit FingerTreestructuralInvariantsizefoldFTtoListreduce1reduce1'strict strictWithmapTreeempty singletonfromListlconsrconsnulllviewrviewappendsplit takeUntil dropUntil splitTreereverse$fCoArbitraryFingerTree$fArbitraryFingerTree$fCoArbitraryNode$fArbitraryNode$fCoArbitraryDigit$fArbitraryDigit$fShowFingerTree$fOrdFingerTree$fEqFingerTree$fMeasuredvFingerTree$fMeasuredvNode$fMeasuredvDigit $fShowDigit $fShowNoderconsUsingAppendrconsUsingFoldrappendUsingFoldr 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 moduleNamecopylheadlheadMltailltailMrheadrheadMmapfoldfold'fold1fold1'foldrfoldr'foldlfoldl'inBoundslookuplookupMlookupWithDefaultadjusttakedroprtailrtailMconcat reverseOnto concatMapfoldr1foldr1'foldl1foldl1'reducerreducelreducer'reducel'update mapWithIndexfoldrWithIndexfoldlWithIndexfoldrWithIndex'foldlWithIndex'splitAtfilter partitionsubseq takeWhile dropWhile splitWhilezipzip3zipWithzipWith3unzipunzip3 unzipWith unzipWith3 $fMonoidSeq$fCoArbitrarySeq$fArbitrarySeq $fReadSeq $fShowSeq$fOrdSeq$fMonadPlusSeq $fMonadSeq$fApplicativeSeq$fAlternativeSeq $fFunctorSeq $fSequenceSeq$fEqSeqinsertSeqUsingUnioninsertSeqUsingFoldrmemberUsingFoldcountUsingMemberlookupAllUsingLookupMdeleteSeqUsingDeleteunionSeqUsingFoldlunionSeqUsingFoldl'unionSeqUsingReducefromSeqUsingFoldrfromSeqUsingUnionSeqtoSeqUsingFold unsafeInsertMaxUsingUnsafeAppendtoOrdSeqUsingFoldr$unsafeFromOrdSeqUsingUnsafeInsertMindisjointUsingToOrdListintersectWitnessUsingToOrdListlookupUsingLookupAlllookupMUsingLookupAlllookupWithDefaultUsingLookupAlldeleteMaxUsingMaxViewfromSeqWithUsingInsertWithinsertUsingInsertWithunionUsingUnionWithfilterUsingOrdListspartitionUsingOrdLists!intersectionUsingIntersectionWithdifferenceUsingOrdLists"symmetricDifferenceUsingDifferenceproperSubsetUsingOrdListssubsetUsingOrdListsproperSubsetOnOrdListssubsetOnOrdListsinsertSeqWithUsingInsertWithunionlUsingUnionWithunionrUsingUnionWithunionWithUsingOrdListsunionSeqWithUsingReducerintersectionWithUsingOrdListsunsafeMapMonotonicUsingFoldrcompareUsingToOrdListHeapinsertuniondelete deleteAll deleteSeqmembercount deleteMinunsafeInsertMinunsafeInsertMax unsafeAppendfilterLTfilterLEfilterGTfilterGEpartitionLT_GEpartitionLE_GTpartitionLT_GTtoSeq lookupAllminViewminElemmaxViewmaxElemunsafeMapMonotonicfromSeq insertSequnionSequnsafeFromOrdSeq deleteMaxtoOrdSeq $fOrdHeap $fMonoidHeap$fCoArbitraryHeap$fArbitraryHeap $fReadHeap $fShowHeap$fEqHeap$fOrdCollHeapa $fCollHeapa$fOrdCollXHeapa $fCollXHeapaSet intersection differencesymmetricDifference properSubsetsubset fromSeqWith insertWith insertSeqWithunionlunionr unionWith unionSeqWithintersectionWith $fOrdSetSeta $fOrdSetXSeta $fSetSeta $fSetXSeta $fOrdCollSeta $fCollSeta$fOrdCollXSeta $fCollXSeta complement setCoercetoBitsfromBits fromOrdSeq$fOrdSet $fMonoidSet$fCoArbitrarySet$fArbitrarySet $fReadSet $fShowSet$fEqSetMinfromColltoColl$fOrdMin $fMonoidMin$fCoArbitraryMin$fArbitraryMin $fReadMin $fShowMin $fOrdCollMina $fCollMina$fOrdCollXMina $fCollXMina$fEqMin$fCoArbitraryElem$fArbitraryElem$fMeasuredSizeMElem $fMonoidSizeM $fEqSizeM $fOrdSizeM $fNumSizeM $fEnumSizeM $fShowSizeM$fEqTreeRev instanceName $fMonoidRev$fCoArbitraryRev$fArbitraryRev $fReadRev $fShowRev$fOrdRev$fEqRev$fMonadPlusRev $fMonadRev$fApplicativeRev$fAlternativeRev $fFunctorRev $fSequenceRevSized $fMonoidSized$fCoArbitrarySized$fArbitrarySized $fReadSized $fShowSized $fOrdSized $fEqSized$fMonadPlusSized $fMonadSized$fApplicativeSized$fAlternativeSized$fFunctorSized$fSequenceSizedsingletonUsingInsertfromSeqUsingInsertSeqdeleteSeqUsingFoldrmemberUsingLookupMpartitionUsingFilterfold1UsingElementselementsUsingFoldnullUsingElementsinsertWithUsingLookupMfromSeqWithUsingInsertSeqWith#fromSeqWithKeyUsingInsertSeqWithKeyinsertWithKeyUsingInsertWith"insertSeqWithKeyUsingInsertWithKeyunionSeqWithUsingReduceunionSeqWithUsingFoldrtoSeqUsingFoldWithKeykeysUsingFoldWithKeyunionWithUsingInsertWithunionWithKeyUsingInsertWithKeyunionSeqWithKeyUsingReduceunionSeqWithKeyUsingFoldrintersectionWithUsingLookupMintersectionWithKeyUsingLookupMdifferenceUsingDeleteproperSubsetUsingSubsetsubsetUsingMembersubmapByUsingLookupMproperSubmapByUsingSubmapBysameMapByUsingOrdListssameMapByUsingSubmapBylookupAndDeleteDefaultlookupAndDeleteMDefaultlookupAndDeleteAllDefaultadjustOrInsertUsingMemberadjustOrDeleteDefaultadjustOrDeleteAllDefaultminElemUsingMinViewdeleteMinUsingMinView!minElemWithKeyUsingMinViewWithKeymaxElemUsingMaxView!maxElemWithKeyUsingMaxViewWithKeytoOrdSeqUsingFoldrWithKeyshowsPrecUsingToOrdListreadsPrecUsingUnsafeFromOrdSeqFMlookupAndDeletelookupAndDeleteMlookupAndDeleteAllelements adjustAlladjustOrInsertadjustAllOrInsertadjustOrDeleteadjustOrDeleteAllkeys mapWithKey foldWithKey foldWithKey' filterWithKeypartitionWithKeyminViewWithKeyminElemWithKeymaxViewWithKeymaxElemWithKey foldrWithKey foldrWithKey' foldlWithKey foldlWithKey' insertWithKeyinsertSeqWithKeyfromSeqWithKeyproperSubmapBysubmapBy sameMapBy properSubmapsubmapsameMap unionWithKeyunionSeqWithKeyintersectionWithKey $fMonoidFM$fCoArbitraryFM $fArbitraryFM$fReadFM$fShowFM$fOrdFM$fEqFM $fFunctorFM$fOrdFiniteMapFMk$fFiniteMapFMk $fOrdAssocFMk $fAssocFMk$fOrdFiniteMapXFMk$fFiniteMapXFMk$fOrdAssocXFMk $fAssocXFMk$fOrdFiniteMapFMInt$fOrdFiniteMapXFMInt$fOrdAssocFMInt$fOrdAssocXFMInt$fFiniteMapFMInt$fFiniteMapXFMInt $fAssocFMInt $fAssocXFMInt$fOrdFiniteMapMapk$fFiniteMapMapk$fOrdAssocMapk $fAssocMapk$fOrdFiniteMapXMapk$fFiniteMapXMapk$fOrdAssocXMapk $fAssocXMapkmergeVFM mergeKVFM$fOrdFiniteMapFM[]$fOrdFiniteMapXFM[]$fOrdAssocFM[]$fOrdAssocXFM[]$fFiniteMapFM[]$fFiniteMapXFM[] $fAssocFM[] $fAssocXFM[]&EdisonAPI-1.3.1-KjkUBwUQ9QtGMmEyFW5iNeData.Edison.PreludeMeasuredghc-prim GHC.TypesFalseTrueEmptySingleDeepNodeNode2Node3DigitOneTwoThreeFour foldDigit reduceDigit digitToList sizeDigitsizeNodefoldNode nodeToListnode2node3 nodeToDigitdeepsizeFTftToList reduce1_auxmapNodemapDigit consDigitrcons0 snocDigit lheadDigit ltailDigit rheadDigit rtailDigit digitToTree appendTree0 addDigits0 appendTree1 addDigits1 appendTree2 addDigits2 appendTree3 addDigits3 appendTree4 addDigits4 mappendValdeepLdeepR splitNode splitDigit reverseTree reverseNode reverseDigittwothreefourEEvenOddhalfmkEvenlookFunmapFstmapSndH1H2makeH2maxView'LnodeT wordLengthcheck countBitsbitcountlsbmsblowMaskhighMask foldrBits foldrBits_aux foldrBits'foldrBits_aux' foldlBits foldlBits_aux foldlBits'foldlBits_aux'MfromPrimtoPrimQmakeQrevfoldr revfoldr'revfoldl revfoldl'BcombinedelAtElemSizeMunSizeMunElemunSeqmapElem mapUnElemACjumpTree strictTreestrictWithTreeNIuinsertmergeFM toRandList mergeSortFMfoldrFMfoldr1FMfoldrFM' foldr1FM'foldlFMfoldlFM'foldrWithKeyFMfoldrWithKeyFM'foldlWithKeyFMfoldlWithKeyFM' takeWhileFM dropWhileFMspanFMfindMinfindMaxinvmakeBlmakeBrmakeB lowestBit branchingBitmaskzeroBit matchPrefixjoinkeepRdoLookupAndDeletesubset' ordListFM ordListFM_revFMBCtxRFMB'FMBbalancesizeFMBmkFMB lookupFMB listToFMBaddToFMBaddToFMlookupAndDelFromFMBlookupAndDelFromFM delFromFMB delFromFM mkBalancedFMBmkVBalancedFMB appendFMBmapVFMmapVFMBmapKVFMnullFMBnullFMsplayFMB mergeVFMB mergeKVFMBbasecasecomb minViewFMBminViewWithKeyFMB minElemFMBminElemWithKeyFMB maxViewFMBmaxViewWithKeyFMB maxElemFMBmaxElemWithKeyFMB filterL_FMB filterG_FMBkeyInvariantFMB actualSizeFMBstructuralInvariantFMBcoarbitrary_maybecoarbitrary_fmb