Data.Diet.Set.Unboxed

Documentation

data Set a

Instances

(Ord a, Enum a, Prim a) => IsList (Set a)

Associated Types

type Item (Set a) :: *

Methods

fromList :: [Item (Set a)] -> Set a

fromListN :: Int -> [Item (Set a)] -> Set a

toList :: Set a -> [Item (Set a)]

(Eq a, Prim a) => Eq (Set a)

Methods

(==) :: Set a -> Set a -> Bool

(/=) :: Set a -> Set a -> Bool

(Ord a, Prim a) => Ord (Set a)

Methods

compare :: Set a -> Set a -> Ordering

(<) :: Set a -> Set a -> Bool

(<=) :: Set a -> Set a -> Bool

(>) :: Set a -> Set a -> Bool

(>=) :: Set a -> Set a -> Bool

max :: Set a -> Set a -> Set a

min :: Set a -> Set a -> Set a

(Show a, Prim a) => Show (Set a)

Methods

showsPrec :: Int -> Set a -> ShowS

show :: Set a -> String

showList :: [Set a] -> ShowS

(Ord a, Enum a, Prim a) => Semigroup (Set a)

Methods

(<>) :: Set a -> Set a -> Set a

sconcat :: NonEmpty (Set a) -> Set a

stimes :: Integral b => b -> Set a -> Set a

(Ord a, Enum a, Prim a) => Monoid (Set a)

Methods

mempty :: Set a

mappend :: Set a -> Set a -> Set a

mconcat :: [Set a] -> Set a

type Item (Set a)

type Item (Set a) = (a, a)

singleton

Arguments

:: (Ord a, Prim a)

=> a

inclusive lower bound

-> a

inclusive upper bound

-> Set a

O(1) Create a diet set with a single element.

member :: (Ord a, Prim a) => a -> Set a -> Bool

O(log n) Lookup the value at a key in the map.

List Conversion

toList :: Prim a => Set a -> [(a, a)]

fromList :: (Ord a, Enum a, Prim a) => [(a, a)] -> Set a

fromListN

Arguments

:: (Ord a, Enum a, Prim a)

=> Int

expected size of resulting diet Set

-> [(a, a)]

key-value pairs

-> Set a