I_?[      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZNone  SafeYNone1u iA data structure that contains a list and the reversals of all initial segments of the list. Intuitively 5reversals xs !! n = reverse (take (n+1) (fromRev xs))Any operation on a RevListJ typically discards the reversals and constructs new reversals on demand."!A functional enumeration of type t is a partition of ty into finite numbered sets called Parts. Each parts contains values of a certain cost (typically the size of the value).[Optimal \ on enumerations.)The definition of pure for the applicative instance.*}Constructs a "Reverse list" variant of a given list. In a sensible Haskell implementation evaluating any inital segment of ! (toRev xs)/ uses linear memory in the size of the segment.]"Adds an element to the head of a RevLists. Constant memory iff the the reversals of the resulting list are not evaluated (which is frequently the case in Feat).+ Padded zip-The ^ is (disjoint) (0Pure is ) and _1 corresponds to cartesian product (as with lists)1?Only use fmap with bijective functions (e.g. data constructors)Q`ab_cdefg^\hijklmnopqrstuvwxyz{|}~  !"#$%&'()*"#$%& !*(')  !"#$None.] 3dMemoised enumeration. Note that all cardinalities are kept in memory until your program terminates. 4Index into an enumeration. Mainly used for party tricks (give it a really large number), since usually you want to distinguish values by size.5cA more fine grained version of index that takes a size and an index into the values of that size.  select p i is only defined for i within bounds (meaning i < fst (values !! p)).6All values of the enumeration by increasing cost (which is the number of constructors for most types). Also contains the length of each list.7vCompatibility with QuickCheck. Distribution is uniform generator over values bounded by the given size. Typical use:  sized uniform.8Non class version of 4.9Non class version of 5:Non class version of 6.;Non class version of 7.<^Enumerates every nth value of the enumeration from a given starting index. As a special case  striped 0 1; gives all values (starts at index 0 and takes steps of 1).7Useful for running enumerations in parallel since e.g.  striped 0 2 is disjoint from  striped 1 2+ and the union of the two cover all values.=A version of values with a limited number of values in each inner list. If the list corresponds to a Part which is larger than the bound it evenly distributes the values across the enumeration of the Part.>ERemove all sizes exept those in the given inclusive (low,high) range 3456789:;<=> 34567<=>89:;None<Reached max size%Reached max number of counterexamples@ FlexOptionsB>The whole execution of the test is sent through this function.CBApplied to each found counterexample, return False to stop testingD Print textE)Applied to the enumeration before runningF-The base enumeration to use, before applying fProcess.GNMuch more flexible options for configuring every part of the test execution. a( is the parameter type of the property. H+Basic options for executing a test. Unlike G# this type has Show/Read instances.K(first size, last size)L!Maximum number of counterexamplesN(start-index, steps to skip)O Maximum number of tests per sizeQG60 seconds timeout, maximum size of 100, bound of 100000 tests per sizeFor testing without using the   class.UTest with default options (Q).VTest with basic options. WMThe most flexible test driver, can be configured to behave in almost any way.?@ABCDEFGHIJKLMNOPQRSTUVWU?PVHIJKLMNOQWG@ABCDEFRST?@ABCDEFHIJKLMNONone>I "34567HIJKLMNOQUVUVHIJKLMNOQ" 34567Safe?i             !"#$%&'(()*++,-./0123456789:;<=>?@ABCDEFGHHIJKLMNOOPQRSTUVWXYZ[\]^_`abcdebcfbcgbchbcibcjbckbclbcmbcnbcobpqbprbpsbptbpubpvbpwbpxbpxbpybz{bz{bz|b}~b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}b}bbcbcbcbcbcbcbcbc+testing-feat-1.0.0.0-3sAgJZpf8fzApxYLsPcWQXTest.Feat.Class Test.FeatTest.Feat.EnumerateTest.Feat.FiniteTest.Feat.AccessTest.Feat.DriverTest.Feat.Modifiers)size-based-0.1.1.0-2LgVTzwGCKQIUcY8avWJusControl.EnumerablederiveEnumerablec7c6c5c4c3c2c1c0datatype enumerate Enumerable Control.SizedpaynullaryunarysharedfuncurryconstsFinitefCardfIndexIndex fromFinitefinFin $fShowFinite$fMonoidFinite$fAlternativeFinite$fApplicativeFinite$fFunctorFiniteRevListfromRev reversals EnumeraterevPartsparts fromParts cartesianunion singletontoRev$fMonoidRevList$fFunctorRevList$fMonoidEnumerate$fSizedEnumerate$fAlternativeEnumerate$fApplicativeEnumerate$fFunctorEnumerate $fShowRevListoptimalindexselectvaluesuniform indexWith selectWith valuesWith uniformWithskippingbounded sizeRangeResult FlexOptionsfIOfReportfOutputfProcessfEnumFlexibleOptionsOptions oTimeoutSec oSizeFromTo oMaxCounteroSilent oSkippingoBoundedcounterexamples defOptionsdefFlextoFlex toFlexWithtest testOptionstestFlex $fShowOptions $fReadOptions $fShowResulteconcatbaseGHC.BasemconcatrevConsmappend<*><$ Applicativepure*>liftA2<*MonoidmemptyControl.Applicativeoptional WrappedMonad WrapMonad unwrapMonad WrappedArrow WrapArrow unwrapArrowZipList getZipListData.Functor.ConstConstgetConst Data.Monoid<>DualgetDualEndoappEndoAllgetAllAnygetAnySumgetSumProduct getProductFirstgetFirstLastgetLastAltgetAlt Data.Functor<$>liftA3liftA<**> Alternativeempty<|>somemany ExhaustedQuota defFlexWithTimedOut4testing-type-modifiers-0.1.0.1-2oRkVJURLTSRHCk8bgluUData.Modifiers printablesunicodes mkNonEmptyNatnatNonZerononZeroNonEmptynonEmptyUnicodeunicode Printable printable