úÎJEHµ            Safem1Optimal median-finding functions for small input.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone ›&Find the median of 3 items, optimally.median3 (<=) 1 2 31median3 (<=) 1 3 22median3 (<=) 2 3 103[x,y,z] !! median3 (<=) x y z === sort [x,y,z] !! 1&Find the median of 4 items, optimally.median4 (<=) 1 4 3 22median4 (<=) 1 3 2 41median4 (<=) 2 4 1 33median4 (<=) 3 1 4 20C[w,x,y,z] !! median4 (<=) w x y z `elem` (init.tail.sort) [w,x,y,z]&Find the median of 5 items, optimally.median5 (<=) 1 4 3 2 52median5 (<=) 1 3 2 4 51median5 (<=) 2 4 1 3 53median5 (<=) 3 1 4 2 50median5 (<=) 2 1 4 5 34@[v,w,x,y,z] !! median5 (<=) v w x y z === sort [v,w,x,y,z] !! 2,Optimal selection functions for small input.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone6Select from 2 items.Select from 3 items.Select from 4 items.Select from 5 items.Noneš ( ) xs lb ub nE partitions the section of the list defined by the inclusive slice [lb,ub] around the element at n.2Quickselect internals on mutable, generic vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNonea ( ) xs lb ub n returns the n0th item in the indices in the inclusive range [lb,ub].)Quickselect algorithm on unboxed vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone• \mathcal{O}(n)7. Find the nth item, ordered by the supplied relation.\i >= 0 && i < length xs ==> sort xs !! i === selectBy (<=) i (Vector.fromList (xs :: [Int])) \mathcal{O}(n)+. Find the nth smallest item in the vector./select 4 (Vector.fromList "this is an example")'a'1select 3 (Vector.fromList [0,1,4,2,3,5,6]) :: Int3  'Quickselect algorithm on boxed vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone$ \mathcal{O}(n)7. Find the nth item, ordered by the supplied relation.Qi >= 0 && i < length xs ==> sort xs !! i === selectBy (<=) i (Vector.fromList xs) \mathcal{O}(n)+. Find the nth smallest item in the vector./select 4 (Vector.fromList "this is an example")'a'*select 3 (Vector.fromList [0,1,4,2,3,5,6])3  8median-of-medians internals on mutable, generic vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone(h   ( ) xs lb ub n returns the n0th item in the indices in the inclusive range [lb,ub].  -Median-of-medians algorithm on boxed vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone/¬\mathcal{O}(n)7. Find the nth item, ordered by the supplied relation.\i >= 0 && i < length xs ==> sort xs !! i === selectBy (<=) i (Vector.fromList (xs :: [Int]))\mathcal{O}(n)+. Find the nth smallest item in the vector./select 4 (Vector.fromList "this is an example")'a'1select 3 (Vector.fromList [0,1,4,2,3,5,6]) :: Int3 -Median-of-medians algorithm on boxed vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone6°\mathcal{O}(n)7. Find the nth item, ordered by the supplied relation.Qi >= 0 && i < length xs ==> sort xs !! i === selectBy (<=) i (Vector.fromList xs)\mathcal{O}(n)+. Find the nth smallest item in the vector./select 4 (Vector.fromList "this is an example")'a'*select 3 (Vector.fromList [0,1,4,2,3,5,6])3 2Introselect internals on mutable, generic vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNone: ( ) xs lb ub n returns the n0th item in the indices in the inclusive range [lb,ub]. )Introselect algorithm on unboxed vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNoneA³\mathcal{O}(n)7. Find the nth item, ordered by the supplied relation.\i >= 0 && i < length xs ==> sort xs !! i === selectBy (<=) i (Vector.fromList (xs :: [Int]))\mathcal{O}(n)+. Find the nth smallest item in the vector./select 4 (Vector.fromList "this is an example")'a'1select 3 (Vector.fromList [0,1,4,2,3,5,6]) :: Int3 'Introselect algorithm on boxed vectors.(c) Donnacha Oisín Kidney, 2018MITmail@doisinkidney.com experimentalportableNoneHŸ\mathcal{O}(n)7. Find the nth item, ordered by the supplied relation.Qi >= 0 && i < length xs ==> sort xs !! i === selectBy (<=) i (Vector.fromList xs)\mathcal{O}(n)+. Find the nth smallest item in the vector./select 4 (Vector.fromList "this is an example")'a'*select 3 (Vector.fromList [0,1,4,2,3,5,6])3          !*quickselect-0.1.0.0-2CkqfIUnNzG9OcgqW7shwjData.Median.OptimalData.Select.OptimalData.Vector.Mutable.PartitionData.Select.Mutable.QuickData.Select.Unboxed.QuickData.Select.QuickData.Select.Mutable.MedianData.Select.Unboxed.MedianData.Select.MedianData.Select.Mutable.IntroData.Select.Unboxed.IntroData.Select.IntroControl.Applicative.LiftManymedian3median4median5select2select3select4select5 partitionselectselectBybaseGHC.BaseliftA2liftA3liftA4liftA5ghc-prim GHC.Classes<=