Data.List.Ordered

Synopsis

• type Positive = Natural
• newtype Ordered a = Ordered {
  • getOrdered :: Map a Positive
  }
• map :: (Ord a, Ord b) => (a -> b) -> Ordered a -> Ordered b
• toList :: Ordered a -> [a]
• unsafeFromList :: Ord a => [a] -> Ordered a
• fromList :: Ord a => [a] -> Maybe (Ordered a)
• ordered :: Ord a => Prism' [a] (Ordered a)
• unsafeOrdered :: Ord a => Iso' [a] (Ordered a)
• elem :: Ord a => a -> Ordered a -> Bool
• occs :: Ord a => a -> Ordered a -> Int
• null :: Ordered k -> Bool
• length :: Ordered a -> Int

Documentation