úÎ!WË(      !"#$%&'Safe!doldolHard coded just for (. Should be improveddoldolCheck )' of `Enum e` whether it have more than  elementsNoneFŠ doldolEncode  from a given collection of * edoldolDecode  to a list of * edoldolShow  as a binary digit +doldolShow  as a binary digit + with a minimum lengthdoldolShow  as a binary digit + with a given lengthdoldolEncode  from a given binary digit +'This allows any character which is not '0' or '1' as '1' doldolEncode * e from a given binary digit + doldolCheck whether ! f1 covers every positive bit in  f2-This implementations implies that when f2 == , then the results of   is same as  doldolCheck whether ' f1 does not cover any positive bit in  f2 doldolApply f with two latter  arguments under the first doldolCheck whether two "s are same or not under the first & fb f1 f2 = (fb .&. f1) == (fb .&. f2)doldol>Check any positive bit of req matches corresponding bit of obj When req is zerobits, this returns -doldol@Check every positive bit of req matches corresponding bit of obj  None©doldolTake  from  !"#$ !"#$None{ .           !"!#$%&'()*+%doldol-0.4.1.2-7lnvM3FITLcLvPDyMRjmjKData.Flag.InternalData.Flag.SimpleData.Flag.Phantom Data.FlagFlagbitLen isFlaggable encodeFlag decodeFlagshowFlag showFlagFit showFlagByreadFlag readFlagSubreadEnumincludeexcludeabouteqAbout includeAbout excludeAboutanyReqallReq PhantomFlagPhFlaggetFlag$fShowPhantomFlag$fEqPhantomFlag$fOrdPhantomFlagbaseGHC.WordWord64GHC.EnummaxBoundEnumGHC.BaseString Data.BitszeroBitsghc-prim GHC.TypesTrue