Moduleghc-9.14.1GHC2021

GHC.Data.OrdList

Provide trees (of instructions), so that lists of instructions can be appended in linear time.

datadata OrdList a

Instances6Functor, Foldable, Traversable, Semigroup, Monoid, Outputable

Functor OrdListDefined in ghc-9.14.1 · GHC.Data.OrdList
Foldable OrdListDefined in ghc-9.14.1 · GHC.Data.OrdList
Traversable OrdListDefined in ghc-9.14.1 · GHC.Data.OrdList
Semigroup (OrdList a)Defined in ghc-9.14.1 · GHC.Data.OrdList
Monoid (OrdList a)Defined in ghc-9.14.1 · GHC.Data.OrdList
Outputable a => Outputable (OrdList a)Defined in ghc-9.14.1 · GHC.Data.OrdList

patternpattern NilOL :: OrdList a

patternpattern ConsOL :: a -> OrdList a -> OrdList a

patternpattern SnocOL :: OrdList a -> a -> OrdList a

valuenilOL :: OrdList a

valueisNilOL :: OrdList a -> Bool

valueunitOL :: a -> OrdList a

valueappOL :: OrdList a -> OrdList a -> OrdList a

valueconsOL :: a -> OrdList a -> OrdList a

valuesnocOL :: OrdList a -> a -> OrdList a

valueconcatOL :: [OrdList a] -> OrdList a

valuelastOL :: OrdList a -> a

valueheadOL :: OrdList a -> a

valuemapOL :: (a -> b) -> OrdList a -> OrdList b

valuemapOL' :: (a -> b) -> OrdList a -> OrdList b

valuefromOL :: OrdList a -> [a]

valuetoOL :: [a] -> OrdList a

valuefoldrOL :: (a -> b -> b) -> b -> OrdList a -> b

valuefoldlOL :: (b -> a -> b) -> b -> OrdList a -> b

Strict left fold.

valuepartitionOL :: (a -> Bool) -> OrdList a -> (OrdList a, OrdList a)

valuereverseOL :: OrdList a -> OrdList a

valuefromOLReverse :: OrdList a -> [a]

valuestrictlyEqOL :: Eq a => OrdList a -> OrdList a -> Bool

Compare not only the values but also the structure of two lists

valuestrictlyOrdOL :: Ord a => OrdList a -> OrdList a -> Ordering

Compare not only the values but also the structure of two lists