Data.Stack.UniqueOrdered

Synopsis

• class Foldable stack => UOStack stack where
  • insert :: (Ord a, Eq a) => a -> stack a -> stack a
  • into :: (Ord a, Eq a) => stack a -> a -> stack a
  • pop :: (Ord a, Eq a) => stack a -> stack a
  • inserts :: (Ord a, Eq a) => [a] -> stack a -> stack a
  • intos :: (Ord a, Eq a) => stack a -> [a] -> stack a
  • merge :: (Ord a, Eq a) => stack a -> stack a -> stack a
• newtype Asc a = Asc {
  • unAsc :: [a]
  }
• newtype Des a = Des {
  • unDes :: [a]
  }

Documentation