úÎ# %?      !"#$%&'()*+,-./0123456789:;<=>NoneCInsert an element into an ordered list while preserving the order. BThe first element of the resulting list is returned individually. 3We need this for construction of a non-empty list. " ?@ABCDEFGHIJK      ?@ABCDEFGHIJKNone  The type 4 can be used for many kinds of list-like structures with restrictions on the size.  T [] a1 is a lazy list containing at least one element.  T (T []) a2 is a lazy list containing at least two elements.   T Vector a( is a vector with at least one element. Q You may also use unboxed vectors but the first element will be stored in a box C and you will not be able to use many functions from this module.   T Maybe a. is a list that contains one or two elements.   T Empty a. is a list that contains exactly one element.   T (T Empty) a/ is a list that contains exactly two elements. $Force immediate generation of Cons. Implementation of  without the  constraint that is needed for . Implementation of   without the  constraint that is needed for  . *maximum is a total function +minimum is a total function ,,sum does not need a zero for initialization -/product does not need a one for initialization 2%If you nest too many non-empty lists ;then the efficient merge-sort (linear-logarithmic runtime) Cwill degenerate to an inefficient insert-sort (quadratic runtime). 5LM !"#$%&'()*+,-./012345NOPQRSTUVWXYZ[\]^_#LM !"#$%&'()*+,-./0123450LM !"#$%&'()*+,-./012345NOPQRSTUVWXYZ[\]^_None  !"#$%&'()*+,-.012345  !"#$%&'()*+,-.012345None 6789:;<=> /6789:;<=> 6789:;<=>/ 6789:;<=>`    !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJJKLMNOPQRSTUVWXYZ[\] non-empty-0.0Data.NonEmpty.Class Data.NonEmptyData.NonEmpty.MixedData.NonEmptyPrivate Applicative<*>pureMonad>>=return Arbitrary arbitraryshrinkSortsortByinsertByZipzipWithAppendappend Singleton singletonViewviewLConsconsEmptyemptyzipsortinsertTheadtail!:forceapplybindtoListflattenfetchreversemapHeadmapTailinitlastfoldl1maximumminimumsumproduct appendRightcyclegroupBy segmentBeforescanl genericScanl appendLefttailsinits $fArbitrary[] $fSortMaybe$fSort[] $fZipMaybe$fZip[] $fAppend[]$fSingletonMaybe $fSingleton[] $fViewMaybe$fView[]$fCons[] $fEmptyMaybe $fEmpty[]Aux$fSortT$fZipT $fAppendT $fSingletonT $fEmptyEmpty$fConsT$fArbitraryEmpty $fViewEmpty$fTraversableEmpty$fFoldableEmpty$fFunctorEmpty$fArbitraryAux $fArbitraryT$fMonadT$fApplicativeT$fTraversableT $fFoldableT $fFunctorT